./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_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_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/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_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/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_5ed9ea5b-632e-4761-ba22-57cea5677045/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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:54:32,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:54:32,337 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:54:32,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:54:32,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:54:32,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:54:32,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:54:32,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:54:32,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:54:32,390 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:54:32,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:54:32,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:54:32,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:54:32,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:54:32,391 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:54:32,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:54:32,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:54:32,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:54:32,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:54:32,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:54:32,395 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:54:32,395 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:54:32,396 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:54:32,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:54:32,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:54:32,396 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:54:32,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:54:32,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:54:32,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:54:32,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:54:32,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:54:32,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:54:32,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:54:32,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:54:32,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:54:32,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:54:32,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:54:32,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:54:32,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:54:32,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:54:32,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:54:32,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:54:32,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:54:32,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:54:32,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:54:32,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:54:32,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:54:32,400 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_5ed9ea5b-632e-4761-ba22-57cea5677045/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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-28 03:54:32,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:54:32,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:54:32,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:54:32,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:54:32,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:54:32,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2024-11-28 03:54:36,122 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/data/cd724765e/790ced0a2394448a8a7c981d815f8c53/FLAGadbbf89b9 [2024-11-28 03:54:36,546 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:54:36,546 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2024-11-28 03:54:36,567 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/data/cd724765e/790ced0a2394448a8a7c981d815f8c53/FLAGadbbf89b9 [2024-11-28 03:54:36,585 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/data/cd724765e/790ced0a2394448a8a7c981d815f8c53 [2024-11-28 03:54:36,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:54:36,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:54:36,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:54:36,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:54:36,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:54:36,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:36" (1/1) ... [2024-11-28 03:54:36,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e494d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:36, skipping insertion in model container [2024-11-28 03:54:36,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:36" (1/1) ... [2024-11-28 03:54:36,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:54:37,315 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:54:37,383 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:54:37,392 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:54:37,404 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:54:37,420 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:54:37,499 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:54:37,499 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:54:37,505 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:54:37,507 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:54:37,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:54:37,546 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:54:37,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:54:37,793 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:54:37,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37 WrapperNode [2024-11-28 03:54:37,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:54:37,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:54:37,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:54:37,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:54:37,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:37,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:37,911 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-28 03:54:37,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:54:37,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:54:37,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:54:37,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:54:37,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:37,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:37,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:38,046 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 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, 4, 42]. [2024-11-28 03:54:38,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:38,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:38,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:38,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:38,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:38,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:38,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:38,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:54:38,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:54:38,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:54:38,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:54:38,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (1/1) ... [2024-11-28 03:54:38,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:54:38,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:54:38,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:54:38,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:54:38,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 03:54:38,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 03:54:38,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 03:54:38,310 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 03:54:38,310 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 03:54:38,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 03:54:38,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:54:38,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:54:38,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:54:38,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 03:54:38,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:54:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:54:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:54:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 03:54:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:54:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:54:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 03:54:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:54:38,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:54:38,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:54:38,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:54:38,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:54:38,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:54:38,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:54:38,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 03:54:38,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:54:38,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:54:38,599 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:54:38,601 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:54:38,605 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:54:38,674 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:54:38,708 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:54:41,764 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-28 03:54:41,764 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:54:41,823 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:54:41,826 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-28 03:54:41,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:41 BoogieIcfgContainer [2024-11-28 03:54:41,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:54:41,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:54:41,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:54:41,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:54:41,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:54:36" (1/3) ... [2024-11-28 03:54:41,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20940769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:54:41, skipping insertion in model container [2024-11-28 03:54:41,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:37" (2/3) ... [2024-11-28 03:54:41,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20940769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:54:41, skipping insertion in model container [2024-11-28 03:54:41,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:41" (3/3) ... [2024-11-28 03:54:41,844 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-1.i [2024-11-28 03:54:41,865 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:54:41,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test2-1.i that has 4 procedures, 1064 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2024-11-28 03:54:41,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:54:41,978 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;@190d9d13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:54:41,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-28 03:54:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 1054 states, 632 states have (on average 2.0126582278481013) internal successors, (1272), 1049 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:54:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 03:54:41,997 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:41,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 03:54:41,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:42,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1758863, now seen corresponding path program 1 times [2024-11-28 03:54:42,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:42,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219510909] [2024-11-28 03:54:42,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219510909] [2024-11-28 03:54:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219510909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:54:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402169671] [2024-11-28 03:54:42,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:42,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:54:42,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:42,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:54:42,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:54:42,384 INFO L87 Difference]: Start difference. First operand has 1054 states, 632 states have (on average 2.0126582278481013) internal successors, (1272), 1049 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:44,124 INFO L93 Difference]: Finished difference Result 1351 states and 1604 transitions. [2024-11-28 03:54:44,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:54:44,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-11-28 03:54:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:44,159 INFO L225 Difference]: With dead ends: 1351 [2024-11-28 03:54:44,161 INFO L226 Difference]: Without dead ends: 1347 [2024-11-28 03:54:44,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:54:44,169 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 383 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:44,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 2651 Invalid, 970 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 03:54:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-11-28 03:54:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1261. [2024-11-28 03:54:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 845 states have (on average 1.8804733727810652) internal successors, (1589), 1256 states have internal predecessors, (1589), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:54:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1595 transitions. [2024-11-28 03:54:44,340 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1595 transitions. Word has length 4 [2024-11-28 03:54:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:44,341 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1595 transitions. [2024-11-28 03:54:44,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1595 transitions. [2024-11-28 03:54:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 03:54:44,341 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:44,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 03:54:44,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:54:44,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:44,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-28 03:54:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:44,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687339930] [2024-11-28 03:54:44,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:44,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:44,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:44,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687339930] [2024-11-28 03:54:44,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687339930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:54:44,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055428631] [2024-11-28 03:54:44,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:44,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:54:44,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:44,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:54:44,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:44,470 INFO L87 Difference]: Start difference. First operand 1261 states and 1595 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:45,301 INFO L93 Difference]: Finished difference Result 1258 states and 1587 transitions. [2024-11-28 03:54:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:54:45,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-28 03:54:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:45,308 INFO L225 Difference]: With dead ends: 1258 [2024-11-28 03:54:45,308 INFO L226 Difference]: Without dead ends: 1258 [2024-11-28 03:54:45,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:45,309 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 1087 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:45,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 862 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:54:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-11-28 03:54:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1258. [2024-11-28 03:54:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 853 states have (on average 1.8534583821805393) internal successors, (1581), 1253 states have internal predecessors, (1581), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:54:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1587 transitions. [2024-11-28 03:54:45,348 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1587 transitions. Word has length 4 [2024-11-28 03:54:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:45,348 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1587 transitions. [2024-11-28 03:54:45,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1587 transitions. [2024-11-28 03:54:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 03:54:45,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:45,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 03:54:45,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:54:45,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:45,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:45,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-28 03:54:45,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379283212] [2024-11-28 03:54:45,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:45,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-28 03:54:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379283212] [2024-11-28 03:54:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379283212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:45,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:45,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:54:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999734111] [2024-11-28 03:54:45,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:45,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:54:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:45,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:54:45,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:45,450 INFO L87 Difference]: Start difference. First operand 1258 states and 1587 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:46,830 INFO L93 Difference]: Finished difference Result 2018 states and 2492 transitions. [2024-11-28 03:54:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:54:46,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-28 03:54:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:46,842 INFO L225 Difference]: With dead ends: 2018 [2024-11-28 03:54:46,843 INFO L226 Difference]: Without dead ends: 2018 [2024-11-28 03:54:46,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:46,845 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 904 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:46,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1695 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 03:54:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2024-11-28 03:54:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1756. [2024-11-28 03:54:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1352 states have (on average 1.827662721893491) internal successors, (2471), 1749 states have internal predecessors, (2471), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2481 transitions. [2024-11-28 03:54:46,927 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2481 transitions. Word has length 4 [2024-11-28 03:54:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:46,928 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2481 transitions. [2024-11-28 03:54:46,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2481 transitions. [2024-11-28 03:54:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:54:46,928 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:46,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:46,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:54:46,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:46,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235122, now seen corresponding path program 1 times [2024-11-28 03:54:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232379325] [2024-11-28 03:54:46,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:47,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232379325] [2024-11-28 03:54:47,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232379325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:54:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827894185] [2024-11-28 03:54:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:47,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:54:47,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:47,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:54:47,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:47,097 INFO L87 Difference]: Start difference. First operand 1756 states and 2481 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-28 03:54:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:48,073 INFO L93 Difference]: Finished difference Result 1795 states and 2413 transitions. [2024-11-28 03:54:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:54:48,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-28 03:54:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:48,081 INFO L225 Difference]: With dead ends: 1795 [2024-11-28 03:54:48,082 INFO L226 Difference]: Without dead ends: 1795 [2024-11-28 03:54:48,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:48,085 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 1072 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:48,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1421 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:54:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-11-28 03:54:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1709. [2024-11-28 03:54:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1352 states have (on average 1.7751479289940828) internal successors, (2400), 1702 states have internal predecessors, (2400), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2410 transitions. [2024-11-28 03:54:48,146 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2410 transitions. Word has length 10 [2024-11-28 03:54:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:48,147 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2410 transitions. [2024-11-28 03:54:48,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-28 03:54:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2410 transitions. [2024-11-28 03:54:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:54:48,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:48,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:48,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:54:48,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:48,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235123, now seen corresponding path program 1 times [2024-11-28 03:54:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:48,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415674227] [2024-11-28 03:54:48,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:48,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415674227] [2024-11-28 03:54:48,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415674227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:48,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:48,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:54:48,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282965250] [2024-11-28 03:54:48,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:48,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:54:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:48,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:54:48,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:48,268 INFO L87 Difference]: Start difference. First operand 1709 states and 2410 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-28 03:54:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:49,288 INFO L93 Difference]: Finished difference Result 2004 states and 2756 transitions. [2024-11-28 03:54:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:54:49,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-28 03:54:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:49,299 INFO L225 Difference]: With dead ends: 2004 [2024-11-28 03:54:49,299 INFO L226 Difference]: Without dead ends: 2004 [2024-11-28 03:54:49,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:49,301 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 864 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:49,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1669 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:54:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2024-11-28 03:54:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1684. [2024-11-28 03:54:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1352 states have (on average 1.738905325443787) internal successors, (2351), 1677 states have internal predecessors, (2351), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2361 transitions. [2024-11-28 03:54:49,370 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2361 transitions. Word has length 10 [2024-11-28 03:54:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:49,370 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2361 transitions. [2024-11-28 03:54:49,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-28 03:54:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2361 transitions. [2024-11-28 03:54:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 03:54:49,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:49,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:49,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:54:49,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:49,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash -564898849, now seen corresponding path program 1 times [2024-11-28 03:54:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:49,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462345370] [2024-11-28 03:54:49,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:49,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462345370] [2024-11-28 03:54:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462345370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:49,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:54:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368320247] [2024-11-28 03:54:49,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:49,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:54:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:49,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:54:49,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:54:49,484 INFO L87 Difference]: Start difference. First operand 1684 states and 2361 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:50,488 INFO L93 Difference]: Finished difference Result 1808 states and 2520 transitions. [2024-11-28 03:54:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:54:50,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-28 03:54:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:50,496 INFO L225 Difference]: With dead ends: 1808 [2024-11-28 03:54:50,496 INFO L226 Difference]: Without dead ends: 1808 [2024-11-28 03:54:50,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:54:50,498 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 1287 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:50,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1402 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:54:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-28 03:54:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1661. [2024-11-28 03:54:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1352 states have (on average 1.6878698224852071) internal successors, (2282), 1654 states have internal predecessors, (2282), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2292 transitions. [2024-11-28 03:54:50,559 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2292 transitions. Word has length 14 [2024-11-28 03:54:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:50,560 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2292 transitions. [2024-11-28 03:54:50,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2292 transitions. [2024-11-28 03:54:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 03:54:50,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:50,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:50,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:54:50,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:50,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash -564898848, now seen corresponding path program 1 times [2024-11-28 03:54:50,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:50,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7120331] [2024-11-28 03:54:50,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:50,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:50,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7120331] [2024-11-28 03:54:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7120331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:50,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:50,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:54:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716758837] [2024-11-28 03:54:50,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:50,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:54:50,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:50,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:54:50,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:54:50,788 INFO L87 Difference]: Start difference. First operand 1661 states and 2292 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:52,288 INFO L93 Difference]: Finished difference Result 2162 states and 2775 transitions. [2024-11-28 03:54:52,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:54:52,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-28 03:54:52,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:52,296 INFO L225 Difference]: With dead ends: 2162 [2024-11-28 03:54:52,297 INFO L226 Difference]: Without dead ends: 2162 [2024-11-28 03:54:52,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:54:52,298 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 1278 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:52,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2255 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 03:54:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2024-11-28 03:54:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1757. [2024-11-28 03:54:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1448 states have (on average 1.6685082872928176) internal successors, (2416), 1750 states have internal predecessors, (2416), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2426 transitions. [2024-11-28 03:54:52,355 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2426 transitions. Word has length 14 [2024-11-28 03:54:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:52,355 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2426 transitions. [2024-11-28 03:54:52,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2426 transitions. [2024-11-28 03:54:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:54:52,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:52,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:52,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:54:52,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:52,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1701595783, now seen corresponding path program 1 times [2024-11-28 03:54:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937579463] [2024-11-28 03:54:52,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937579463] [2024-11-28 03:54:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937579463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:52,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:52,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:54:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028162028] [2024-11-28 03:54:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:52,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:54:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:52,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:54:52,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:54:52,484 INFO L87 Difference]: Start difference. First operand 1757 states and 2426 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:52,569 INFO L93 Difference]: Finished difference Result 1429 states and 1909 transitions. [2024-11-28 03:54:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:54:52,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 03:54:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:52,574 INFO L225 Difference]: With dead ends: 1429 [2024-11-28 03:54:52,574 INFO L226 Difference]: Without dead ends: 1429 [2024-11-28 03:54:52,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:54:52,575 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 45 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:52,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2812 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:54:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2024-11-28 03:54:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1429. [2024-11-28 03:54:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1139 states have (on average 1.6672519754170325) internal successors, (1899), 1422 states have internal predecessors, (1899), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1909 transitions. [2024-11-28 03:54:52,606 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1909 transitions. Word has length 16 [2024-11-28 03:54:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:52,607 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1909 transitions. [2024-11-28 03:54:52,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1909 transitions. [2024-11-28 03:54:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:54:52,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:52,608 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] [2024-11-28 03:54:52,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:54:52,608 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:52,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2113969666, now seen corresponding path program 1 times [2024-11-28 03:54:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971525462] [2024-11-28 03:54:52,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:52,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:52,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971525462] [2024-11-28 03:54:52,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971525462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:52,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:52,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:54:52,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695299790] [2024-11-28 03:54:52,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:52,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:54:52,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:52,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:54:52,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:52,694 INFO L87 Difference]: Start difference. First operand 1429 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:52,728 INFO L93 Difference]: Finished difference Result 1279 states and 1679 transitions. [2024-11-28 03:54:52,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:54:52,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-28 03:54:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:52,750 INFO L225 Difference]: With dead ends: 1279 [2024-11-28 03:54:52,751 INFO L226 Difference]: Without dead ends: 1279 [2024-11-28 03:54:52,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:52,753 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 71 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:52,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1617 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:54:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-11-28 03:54:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2024-11-28 03:54:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1013 states have (on average 1.6475814412635736) internal successors, (1669), 1272 states have internal predecessors, (1669), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1679 transitions. [2024-11-28 03:54:52,781 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1679 transitions. Word has length 20 [2024-11-28 03:54:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:52,782 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1679 transitions. [2024-11-28 03:54:52,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1679 transitions. [2024-11-28 03:54:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 03:54:52,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:52,783 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] [2024-11-28 03:54:52,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:54:52,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:52,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash 5595258, now seen corresponding path program 1 times [2024-11-28 03:54:52,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:52,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397826063] [2024-11-28 03:54:52,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:52,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:52,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397826063] [2024-11-28 03:54:52,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397826063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:52,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:52,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:54:52,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619107766] [2024-11-28 03:54:52,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:52,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:54:52,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:52,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:54:52,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:54:52,895 INFO L87 Difference]: Start difference. First operand 1279 states and 1679 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:52,970 INFO L93 Difference]: Finished difference Result 1249 states and 1621 transitions. [2024-11-28 03:54:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:54:52,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-28 03:54:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:52,976 INFO L225 Difference]: With dead ends: 1249 [2024-11-28 03:54:52,976 INFO L226 Difference]: Without dead ends: 1249 [2024-11-28 03:54:52,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:54:52,978 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 48 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:52,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2359 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:54:52,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-28 03:54:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-11-28 03:54:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 997 states have (on average 1.6158475426278835) internal successors, (1611), 1242 states have internal predecessors, (1611), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1621 transitions. [2024-11-28 03:54:53,008 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1621 transitions. Word has length 22 [2024-11-28 03:54:53,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:53,008 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1621 transitions. [2024-11-28 03:54:53,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1621 transitions. [2024-11-28 03:54:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 03:54:53,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:53,010 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] [2024-11-28 03:54:53,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:54:53,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:53,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:53,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1582467048, now seen corresponding path program 1 times [2024-11-28 03:54:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:53,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463612311] [2024-11-28 03:54:53,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463612311] [2024-11-28 03:54:53,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463612311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:53,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:53,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:54:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267869648] [2024-11-28 03:54:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:53,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:54:53,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:53,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:54:53,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:54:53,114 INFO L87 Difference]: Start difference. First operand 1249 states and 1621 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:53,836 INFO L93 Difference]: Finished difference Result 1383 states and 1768 transitions. [2024-11-28 03:54:53,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:54:53,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-28 03:54:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:53,841 INFO L225 Difference]: With dead ends: 1383 [2024-11-28 03:54:53,841 INFO L226 Difference]: Without dead ends: 1383 [2024-11-28 03:54:53,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:54:53,842 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 925 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:53,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1566 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:54:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-28 03:54:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1245. [2024-11-28 03:54:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 997 states have (on average 1.6078234704112337) internal successors, (1603), 1238 states have internal predecessors, (1603), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1613 transitions. [2024-11-28 03:54:53,866 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1613 transitions. Word has length 36 [2024-11-28 03:54:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:53,866 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1613 transitions. [2024-11-28 03:54:53,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1613 transitions. [2024-11-28 03:54:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 03:54:53,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:53,867 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] [2024-11-28 03:54:53,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:54:53,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:53,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1582467049, now seen corresponding path program 1 times [2024-11-28 03:54:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:53,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944684205] [2024-11-28 03:54:53,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944684205] [2024-11-28 03:54:54,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944684205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:54,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:54,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:54:54,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206197289] [2024-11-28 03:54:54,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:54,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:54:54,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:54,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:54:54,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:54:54,094 INFO L87 Difference]: Start difference. First operand 1245 states and 1613 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:54,979 INFO L93 Difference]: Finished difference Result 1829 states and 2411 transitions. [2024-11-28 03:54:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:54:54,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-28 03:54:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:54,985 INFO L225 Difference]: With dead ends: 1829 [2024-11-28 03:54:54,985 INFO L226 Difference]: Without dead ends: 1829 [2024-11-28 03:54:54,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:54:54,986 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 659 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:54,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1910 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:54:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2024-11-28 03:54:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1241. [2024-11-28 03:54:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 997 states have (on average 1.5997993981945837) internal successors, (1595), 1234 states have internal predecessors, (1595), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1605 transitions. [2024-11-28 03:54:55,016 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1605 transitions. Word has length 36 [2024-11-28 03:54:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:55,016 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1605 transitions. [2024-11-28 03:54:55,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1605 transitions. [2024-11-28 03:54:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 03:54:55,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:55,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:55,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:54:55,023 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:55,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:55,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1978501923, now seen corresponding path program 1 times [2024-11-28 03:54:55,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:55,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888923872] [2024-11-28 03:54:55,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:55,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888923872] [2024-11-28 03:54:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888923872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:54:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929469262] [2024-11-28 03:54:55,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:55,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:54:55,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:55,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:54:55,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:54:55,218 INFO L87 Difference]: Start difference. First operand 1241 states and 1605 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:55,278 INFO L93 Difference]: Finished difference Result 1223 states and 1575 transitions. [2024-11-28 03:54:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:54:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-28 03:54:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:55,284 INFO L225 Difference]: With dead ends: 1223 [2024-11-28 03:54:55,284 INFO L226 Difference]: Without dead ends: 1223 [2024-11-28 03:54:55,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:54:55,285 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 27 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:55,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2330 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:54:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-28 03:54:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2024-11-28 03:54:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 979 states have (on average 1.5985699693564863) internal successors, (1565), 1216 states have internal predecessors, (1565), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1575 transitions. [2024-11-28 03:54:55,312 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1575 transitions. Word has length 62 [2024-11-28 03:54:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:55,312 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1575 transitions. [2024-11-28 03:54:55,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1575 transitions. [2024-11-28 03:54:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 03:54:55,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:55,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:55,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:54:55,315 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:55,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:55,316 INFO L85 PathProgramCache]: Analyzing trace with hash -12119383, now seen corresponding path program 1 times [2024-11-28 03:54:55,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:55,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394273523] [2024-11-28 03:54:55,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:55,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:55,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394273523] [2024-11-28 03:54:55,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394273523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:55,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:55,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:54:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865107238] [2024-11-28 03:54:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:55,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:54:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:55,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:54:55,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:55,491 INFO L87 Difference]: Start difference. First operand 1223 states and 1575 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:55,569 INFO L93 Difference]: Finished difference Result 1495 states and 1889 transitions. [2024-11-28 03:54:55,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:54:55,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-28 03:54:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:55,575 INFO L225 Difference]: With dead ends: 1495 [2024-11-28 03:54:55,575 INFO L226 Difference]: Without dead ends: 1495 [2024-11-28 03:54:55,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:54:55,576 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 206 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1569 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-28 03:54:55,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1569 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:54:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-28 03:54:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1482. [2024-11-28 03:54:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1238 states have (on average 1.5145395799676897) internal successors, (1875), 1475 states have internal predecessors, (1875), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1885 transitions. [2024-11-28 03:54:55,605 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1885 transitions. Word has length 70 [2024-11-28 03:54:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:55,605 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1885 transitions. [2024-11-28 03:54:55,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1885 transitions. [2024-11-28 03:54:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-28 03:54:55,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:55,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:55,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:54:55,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:55,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 836446931, now seen corresponding path program 1 times [2024-11-28 03:54:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614897041] [2024-11-28 03:54:55,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:56,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614897041] [2024-11-28 03:54:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614897041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:56,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:56,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:54:56,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804559219] [2024-11-28 03:54:56,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:56,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:54:56,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:56,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:54:56,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:54:56,149 INFO L87 Difference]: Start difference. First operand 1482 states and 1885 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:56,359 INFO L93 Difference]: Finished difference Result 2102 states and 2618 transitions. [2024-11-28 03:54:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:54:56,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 76 [2024-11-28 03:54:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:56,369 INFO L225 Difference]: With dead ends: 2102 [2024-11-28 03:54:56,370 INFO L226 Difference]: Without dead ends: 2099 [2024-11-28 03:54:56,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:54:56,373 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 734 mSDsluCounter, 3498 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 4507 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:56,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 4507 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:54:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-11-28 03:54:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1383. [2024-11-28 03:54:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1139 states have (on average 1.533801580333626) internal successors, (1747), 1376 states have internal predecessors, (1747), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1757 transitions. [2024-11-28 03:54:56,404 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1757 transitions. Word has length 76 [2024-11-28 03:54:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:56,404 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1757 transitions. [2024-11-28 03:54:56,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1757 transitions. [2024-11-28 03:54:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 03:54:56,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:56,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:56,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:54:56,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:56,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash 5623378, now seen corresponding path program 1 times [2024-11-28 03:54:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271133697] [2024-11-28 03:54:56,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:56,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271133697] [2024-11-28 03:54:56,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271133697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:56,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:56,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:54:56,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237048458] [2024-11-28 03:54:56,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:56,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:54:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:56,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:54:56,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:54:56,571 INFO L87 Difference]: Start difference. First operand 1383 states and 1757 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:56,655 INFO L93 Difference]: Finished difference Result 1365 states and 1727 transitions. [2024-11-28 03:54:56,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:54:56,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-28 03:54:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:56,660 INFO L225 Difference]: With dead ends: 1365 [2024-11-28 03:54:56,660 INFO L226 Difference]: Without dead ends: 1365 [2024-11-28 03:54:56,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:54:56,661 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 21 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:56,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2324 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:54:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-11-28 03:54:56,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1365. [2024-11-28 03:54:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1121 states have (on average 1.5316681534344336) internal successors, (1717), 1358 states have internal predecessors, (1717), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1727 transitions. [2024-11-28 03:54:56,689 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1727 transitions. Word has length 78 [2024-11-28 03:54:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:56,689 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 1727 transitions. [2024-11-28 03:54:56,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1727 transitions. [2024-11-28 03:54:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 03:54:56,690 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:56,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:56,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:54:56,690 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:56,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash -18190178, now seen corresponding path program 1 times [2024-11-28 03:54:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:56,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293107453] [2024-11-28 03:54:56,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:57,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293107453] [2024-11-28 03:54:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293107453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:57,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:54:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042314178] [2024-11-28 03:54:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:57,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:54:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:57,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:54:57,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:54:57,053 INFO L87 Difference]: Start difference. First operand 1365 states and 1727 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:57,827 INFO L93 Difference]: Finished difference Result 1364 states and 1725 transitions. [2024-11-28 03:54:57,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:54:57,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-28 03:54:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:57,836 INFO L225 Difference]: With dead ends: 1364 [2024-11-28 03:54:57,836 INFO L226 Difference]: Without dead ends: 1364 [2024-11-28 03:54:57,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:54:57,837 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 2 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:57,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2331 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:54:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-11-28 03:54:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2024-11-28 03:54:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1121 states have (on average 1.5298840321141838) internal successors, (1715), 1357 states have internal predecessors, (1715), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1725 transitions. [2024-11-28 03:54:57,884 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1725 transitions. Word has length 86 [2024-11-28 03:54:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:57,884 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1725 transitions. [2024-11-28 03:54:57,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1725 transitions. [2024-11-28 03:54:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 03:54:57,889 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:57,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:57,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:54:57,891 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:57,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:57,891 INFO L85 PathProgramCache]: Analyzing trace with hash -18190177, now seen corresponding path program 1 times [2024-11-28 03:54:57,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:57,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556191435] [2024-11-28 03:54:57,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:58,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556191435] [2024-11-28 03:54:58,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556191435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:58,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:58,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:54:58,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721629864] [2024-11-28 03:54:58,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:58,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:54:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:58,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:54:58,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:54:58,545 INFO L87 Difference]: Start difference. First operand 1364 states and 1725 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:59,574 INFO L93 Difference]: Finished difference Result 1363 states and 1723 transitions. [2024-11-28 03:54:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:54:59,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-28 03:54:59,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:54:59,582 INFO L225 Difference]: With dead ends: 1363 [2024-11-28 03:54:59,586 INFO L226 Difference]: Without dead ends: 1363 [2024-11-28 03:54:59,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:54:59,587 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 1 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:54:59,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2257 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:54:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2024-11-28 03:54:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2024-11-28 03:54:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1119 states have (on average 1.5308310991957104) internal successors, (1713), 1356 states have internal predecessors, (1713), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:54:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1723 transitions. [2024-11-28 03:54:59,617 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1723 transitions. Word has length 86 [2024-11-28 03:54:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:54:59,618 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1723 transitions. [2024-11-28 03:54:59,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:54:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1723 transitions. [2024-11-28 03:54:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 03:54:59,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:54:59,619 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-28 03:54:59,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:54:59,620 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:54:59,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1418734117, now seen corresponding path program 1 times [2024-11-28 03:54:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:59,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692377695] [2024-11-28 03:54:59,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:59,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:59,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:59,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692377695] [2024-11-28 03:54:59,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692377695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:59,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:59,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:54:59,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865824667] [2024-11-28 03:54:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:59,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:54:59,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:59,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:54:59,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:54:59,943 INFO L87 Difference]: Start difference. First operand 1363 states and 1723 transitions. Second operand has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:00,734 INFO L93 Difference]: Finished difference Result 1381 states and 1749 transitions. [2024-11-28 03:55:00,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:55:00,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-28 03:55:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:00,740 INFO L225 Difference]: With dead ends: 1381 [2024-11-28 03:55:00,741 INFO L226 Difference]: Without dead ends: 1381 [2024-11-28 03:55:00,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:55:00,741 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 6 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:00,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3128 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:55:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-28 03:55:00,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1372. [2024-11-28 03:55:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1127 states have (on average 1.5297249334516416) internal successors, (1724), 1363 states have internal predecessors, (1724), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-28 03:55:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1739 transitions. [2024-11-28 03:55:00,767 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1739 transitions. Word has length 94 [2024-11-28 03:55:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:00,768 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1739 transitions. [2024-11-28 03:55:00,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1739 transitions. [2024-11-28 03:55:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-28 03:55:00,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:00,769 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-28 03:55:00,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:55:00,769 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:00,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:00,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1418734118, now seen corresponding path program 1 times [2024-11-28 03:55:00,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:00,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507678969] [2024-11-28 03:55:00,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:00,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:01,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507678969] [2024-11-28 03:55:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507678969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:55:01,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:55:01,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:55:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666461169] [2024-11-28 03:55:01,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:55:01,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:55:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:01,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:55:01,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:55:01,446 INFO L87 Difference]: Start difference. First operand 1372 states and 1739 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:02,524 INFO L93 Difference]: Finished difference Result 1372 states and 1737 transitions. [2024-11-28 03:55:02,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:55:02,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-28 03:55:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:02,528 INFO L225 Difference]: With dead ends: 1372 [2024-11-28 03:55:02,529 INFO L226 Difference]: Without dead ends: 1372 [2024-11-28 03:55:02,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:55:02,530 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 1 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:02,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2929 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:55:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-11-28 03:55:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2024-11-28 03:55:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1127 states have (on average 1.5279503105590062) internal successors, (1722), 1363 states have internal predecessors, (1722), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-28 03:55:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1737 transitions. [2024-11-28 03:55:02,562 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1737 transitions. Word has length 94 [2024-11-28 03:55:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:02,563 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1737 transitions. [2024-11-28 03:55:02,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1737 transitions. [2024-11-28 03:55:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 03:55:02,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:02,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:55:02,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:55:02,564 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:02,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:02,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1624609176, now seen corresponding path program 1 times [2024-11-28 03:55:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:02,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434231880] [2024-11-28 03:55:02,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:02,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:03,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:03,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434231880] [2024-11-28 03:55:03,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434231880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:03,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103241880] [2024-11-28 03:55:03,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:03,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:55:03,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:55:03,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:55:03,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:55:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:03,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 03:55:03,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:55:03,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:55:03,790 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:55:03,790 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-28 03:55:03,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:55:03,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:55:04,258 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:04,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:55:04,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:55:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:04,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:55:04,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103241880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:04,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:55:04,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-28 03:55:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967470154] [2024-11-28 03:55:04,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:55:04,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:55:04,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:04,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:55:04,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=319, Unknown=5, NotChecked=0, Total=380 [2024-11-28 03:55:04,489 INFO L87 Difference]: Start difference. First operand 1372 states and 1737 transitions. Second operand has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:07,243 INFO L93 Difference]: Finished difference Result 1379 states and 1743 transitions. [2024-11-28 03:55:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:55:07,245 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 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 95 [2024-11-28 03:55:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:07,248 INFO L225 Difference]: With dead ends: 1379 [2024-11-28 03:55:07,248 INFO L226 Difference]: Without dead ends: 1379 [2024-11-28 03:55:07,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=464, Unknown=5, NotChecked=0, Total=552 [2024-11-28 03:55:07,250 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 710 mSDsluCounter, 4867 mSDsCounter, 0 mSdLazyCounter, 3358 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:07,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 5369 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3358 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 03:55:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-28 03:55:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2024-11-28 03:55:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1131 states have (on average 1.5251989389920424) internal successors, (1725), 1366 states have internal predecessors, (1725), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:55:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1737 transitions. [2024-11-28 03:55:07,274 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1737 transitions. Word has length 95 [2024-11-28 03:55:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:07,274 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1737 transitions. [2024-11-28 03:55:07,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.3125) internal successors, (149), 18 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1737 transitions. [2024-11-28 03:55:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 03:55:07,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:07,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:55:07,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:55:07,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 03:55:07,476 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:07,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1624609177, now seen corresponding path program 1 times [2024-11-28 03:55:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:07,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107256875] [2024-11-28 03:55:07,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:08,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:08,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107256875] [2024-11-28 03:55:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107256875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:08,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865431616] [2024-11-28 03:55:08,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:08,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:55:08,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:55:08,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:55:08,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:55:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:08,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 03:55:08,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:55:08,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:55:08,864 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:55:08,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:55:08,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:55:08,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:55:08,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:55:09,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:55:09,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:55:09,190 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:09,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:55:09,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:55:09,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:55:09,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:55:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:09,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:55:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865431616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:09,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:55:09,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-28 03:55:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066828110] [2024-11-28 03:55:09,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:55:09,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:55:09,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:09,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:55:09,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=347, Unknown=12, NotChecked=0, Total=420 [2024-11-28 03:55:09,519 INFO L87 Difference]: Start difference. First operand 1376 states and 1737 transitions. Second operand has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:13,141 INFO L93 Difference]: Finished difference Result 1378 states and 1741 transitions. [2024-11-28 03:55:13,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:55:13,141 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 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 95 [2024-11-28 03:55:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:13,145 INFO L225 Difference]: With dead ends: 1378 [2024-11-28 03:55:13,145 INFO L226 Difference]: Without dead ends: 1378 [2024-11-28 03:55:13,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=492, Unknown=13, NotChecked=0, Total=600 [2024-11-28 03:55:13,147 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 704 mSDsluCounter, 4476 mSDsCounter, 0 mSdLazyCounter, 4587 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 4981 SdHoareTripleChecker+Invalid, 4607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:13,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 4981 Invalid, 4607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4587 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-28 03:55:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-28 03:55:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1366. [2024-11-28 03:55:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1123 states have (on average 1.5262689225289403) internal successors, (1714), 1358 states have internal predecessors, (1714), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:55:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1724 transitions. [2024-11-28 03:55:13,168 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1724 transitions. Word has length 95 [2024-11-28 03:55:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:13,169 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1724 transitions. [2024-11-28 03:55:13,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.933333333333334) internal successors, (149), 18 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1724 transitions. [2024-11-28 03:55:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 03:55:13,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:13,170 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-28 03:55:13,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:55:13,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 03:55:13,375 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:13,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1264437883, now seen corresponding path program 1 times [2024-11-28 03:55:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:13,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281079055] [2024-11-28 03:55:13,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281079055] [2024-11-28 03:55:14,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281079055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:55:14,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:55:14,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:55:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343828757] [2024-11-28 03:55:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:55:14,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:55:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:14,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:55:14,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:55:14,056 INFO L87 Difference]: Start difference. First operand 1366 states and 1724 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:15,578 INFO L93 Difference]: Finished difference Result 1385 states and 1749 transitions. [2024-11-28 03:55:15,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:55:15,579 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2024-11-28 03:55:15,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:15,582 INFO L225 Difference]: With dead ends: 1385 [2024-11-28 03:55:15,582 INFO L226 Difference]: Without dead ends: 1385 [2024-11-28 03:55:15,583 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-28 03:55:15,583 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 738 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 3938 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:15,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 3938 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 03:55:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-28 03:55:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1381. [2024-11-28 03:55:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1137 states have (on average 1.5224274406332454) internal successors, (1731), 1371 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:55:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1743 transitions. [2024-11-28 03:55:15,610 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1743 transitions. Word has length 97 [2024-11-28 03:55:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:15,610 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1743 transitions. [2024-11-28 03:55:15,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1743 transitions. [2024-11-28 03:55:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-28 03:55:15,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:15,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:55:15,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:55:15,612 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:15,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:15,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1264437882, now seen corresponding path program 1 times [2024-11-28 03:55:15,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:15,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360141090] [2024-11-28 03:55:15,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:15,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:16,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:16,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360141090] [2024-11-28 03:55:16,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360141090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:55:16,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:55:16,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:55:16,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111140716] [2024-11-28 03:55:16,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:55:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:55:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:16,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:55:16,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:55:16,503 INFO L87 Difference]: Start difference. First operand 1381 states and 1743 transitions. Second operand has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:18,737 INFO L93 Difference]: Finished difference Result 1384 states and 1747 transitions. [2024-11-28 03:55:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:55:18,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2024-11-28 03:55:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:18,741 INFO L225 Difference]: With dead ends: 1384 [2024-11-28 03:55:18,742 INFO L226 Difference]: Without dead ends: 1384 [2024-11-28 03:55:18,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:55:18,742 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 714 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:18,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 3001 Invalid, 2615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 03:55:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-28 03:55:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2024-11-28 03:55:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1137 states have (on average 1.5206684256816183) internal successors, (1729), 1371 states have internal predecessors, (1729), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:55:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1741 transitions. [2024-11-28 03:55:18,765 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1741 transitions. Word has length 97 [2024-11-28 03:55:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:18,766 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1741 transitions. [2024-11-28 03:55:18,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1741 transitions. [2024-11-28 03:55:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 03:55:18,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:18,769 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] [2024-11-28 03:55:18,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 03:55:18,770 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:18,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:18,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1253853902, now seen corresponding path program 1 times [2024-11-28 03:55:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:18,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508097142] [2024-11-28 03:55:18,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:19,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508097142] [2024-11-28 03:55:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508097142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87990350] [2024-11-28 03:55:19,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:19,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:55:19,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:55:19,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:55:19,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:55:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:19,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:55:19,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:55:19,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:55:19,937 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:55:19,937 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-28 03:55:19,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:55:20,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:55:20,292 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:20,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:55:20,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:20,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:55:20,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:55:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:20,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:55:20,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1066))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:55:20,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87990350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:20,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:55:20,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-28 03:55:20,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017833542] [2024-11-28 03:55:20,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:55:20,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 03:55:20,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:20,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 03:55:20,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=456, Unknown=18, NotChecked=44, Total=600 [2024-11-28 03:55:20,627 INFO L87 Difference]: Start difference. First operand 1381 states and 1741 transitions. Second operand has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:24,282 INFO L93 Difference]: Finished difference Result 1383 states and 1745 transitions. [2024-11-28 03:55:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:55:24,282 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 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 98 [2024-11-28 03:55:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:24,285 INFO L225 Difference]: With dead ends: 1383 [2024-11-28 03:55:24,285 INFO L226 Difference]: Without dead ends: 1383 [2024-11-28 03:55:24,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=583, Unknown=19, NotChecked=50, Total=756 [2024-11-28 03:55:24,286 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 693 mSDsluCounter, 6353 mSDsCounter, 0 mSdLazyCounter, 4281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 6854 SdHoareTripleChecker+Invalid, 4294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:24,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 6854 Invalid, 4294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4281 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-28 03:55:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-28 03:55:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1380. [2024-11-28 03:55:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1137 states have (on average 1.5189094107299912) internal successors, (1727), 1370 states have internal predecessors, (1727), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:55:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1739 transitions. [2024-11-28 03:55:24,304 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1739 transitions. Word has length 98 [2024-11-28 03:55:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:24,305 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 1739 transitions. [2024-11-28 03:55:24,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.157894736842104) internal successors, (155), 21 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1739 transitions. [2024-11-28 03:55:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 03:55:24,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:24,306 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] [2024-11-28 03:55:24,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:55:24,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 03:55:24,507 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:24,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:24,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1253853901, now seen corresponding path program 1 times [2024-11-28 03:55:24,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:24,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663864025] [2024-11-28 03:55:24,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:24,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:25,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663864025] [2024-11-28 03:55:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663864025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150167259] [2024-11-28 03:55:25,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:25,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:55:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:55:25,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:55:25,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:55:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:25,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 03:55:25,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:55:25,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:55:26,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 8 treesize of output 1 [2024-11-28 03:55:26,109 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:55:26,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:55:26,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:55:26,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:55:26,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:55:26,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:55:26,428 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:26,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:55:26,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:55:26,542 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:26,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:55:26,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:55:26,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:55:26,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:55:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:26,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:55:26,763 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1218 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:55:26,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1223))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1224) .cse0 v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1224) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-28 03:55:26,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150167259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:26,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:55:26,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2024-11-28 03:55:26,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18782457] [2024-11-28 03:55:26,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:55:26,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 03:55:26,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:26,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 03:55:26,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=8, NotChecked=74, Total=462 [2024-11-28 03:55:26,838 INFO L87 Difference]: Start difference. First operand 1380 states and 1739 transitions. Second operand has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:30,187 INFO L93 Difference]: Finished difference Result 1382 states and 1743 transitions. [2024-11-28 03:55:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:55:30,188 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2024-11-28 03:55:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:30,193 INFO L225 Difference]: With dead ends: 1382 [2024-11-28 03:55:30,193 INFO L226 Difference]: Without dead ends: 1382 [2024-11-28 03:55:30,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=493, Unknown=10, NotChecked=94, Total=702 [2024-11-28 03:55:30,194 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 698 mSDsluCounter, 4574 mSDsCounter, 0 mSdLazyCounter, 4400 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 5078 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:30,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 5078 Invalid, 4415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4400 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 03:55:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-28 03:55:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1364. [2024-11-28 03:55:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1123 states have (on average 1.522707034728406) internal successors, (1710), 1356 states have internal predecessors, (1710), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:55:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1720 transitions. [2024-11-28 03:55:30,219 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1720 transitions. Word has length 98 [2024-11-28 03:55:30,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:30,220 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1720 transitions. [2024-11-28 03:55:30,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.571428571428571) internal successors, (148), 17 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1720 transitions. [2024-11-28 03:55:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 03:55:30,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:30,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:55:30,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 03:55:30,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 03:55:30,427 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:30,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2005137076, now seen corresponding path program 1 times [2024-11-28 03:55:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:30,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278338869] [2024-11-28 03:55:30,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:31,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:31,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278338869] [2024-11-28 03:55:31,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278338869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:55:31,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:55:31,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 03:55:31,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048076862] [2024-11-28 03:55:31,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:55:31,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:55:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:31,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:55:31,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:55:31,131 INFO L87 Difference]: Start difference. First operand 1364 states and 1720 transitions. Second operand has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:32,804 INFO L93 Difference]: Finished difference Result 1389 states and 1751 transitions. [2024-11-28 03:55:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:55:32,805 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-28 03:55:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:32,808 INFO L225 Difference]: With dead ends: 1389 [2024-11-28 03:55:32,808 INFO L226 Difference]: Without dead ends: 1389 [2024-11-28 03:55:32,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 03:55:32,808 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 741 mSDsluCounter, 3431 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 3932 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:32,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 3932 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 03:55:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-28 03:55:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1385. [2024-11-28 03:55:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1143 states have (on average 1.5161854768153982) internal successors, (1733), 1375 states have internal predecessors, (1733), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:55:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1745 transitions. [2024-11-28 03:55:32,826 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1745 transitions. Word has length 100 [2024-11-28 03:55:32,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:32,826 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1745 transitions. [2024-11-28 03:55:32,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1745 transitions. [2024-11-28 03:55:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 03:55:32,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:32,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:55:32,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 03:55:32,828 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:32,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2005137075, now seen corresponding path program 1 times [2024-11-28 03:55:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178385321] [2024-11-28 03:55:32,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:33,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178385321] [2024-11-28 03:55:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178385321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:55:33,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:55:33,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:55:33,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407148983] [2024-11-28 03:55:33,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:55:33,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:55:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:33,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:55:33,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:55:33,918 INFO L87 Difference]: Start difference. First operand 1385 states and 1745 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:36,425 INFO L93 Difference]: Finished difference Result 1388 states and 1749 transitions. [2024-11-28 03:55:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:55:36,426 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2024-11-28 03:55:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:36,429 INFO L225 Difference]: With dead ends: 1388 [2024-11-28 03:55:36,430 INFO L226 Difference]: Without dead ends: 1388 [2024-11-28 03:55:36,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:55:36,431 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 716 mSDsluCounter, 3333 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3838 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:36,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3838 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 03:55:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-28 03:55:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1385. [2024-11-28 03:55:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1143 states have (on average 1.5144356955380578) internal successors, (1731), 1375 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:55:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1743 transitions. [2024-11-28 03:55:36,453 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1743 transitions. Word has length 100 [2024-11-28 03:55:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:36,453 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1743 transitions. [2024-11-28 03:55:36,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1743 transitions. [2024-11-28 03:55:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 03:55:36,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:36,455 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] [2024-11-28 03:55:36,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 03:55:36,455 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:36,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash -230371713, now seen corresponding path program 1 times [2024-11-28 03:55:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:36,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89192080] [2024-11-28 03:55:36,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:36,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:37,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:37,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89192080] [2024-11-28 03:55:37,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89192080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:37,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132846016] [2024-11-28 03:55:37,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:37,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:55:37,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:55:37,302 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:55:37,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:55:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:37,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-28 03:55:37,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:55:37,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:55:37,833 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:55:37,833 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-28 03:55:37,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:55:38,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:55:38,266 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:38,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:55:38,402 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:38,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:55:38,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:38,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:55:38,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:55:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:38,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:55:38,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1530 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1530) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 03:55:38,660 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1529 (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$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1529))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1530)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:55:38,670 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1529 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1529))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1530)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:55:38,708 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1529 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1533))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1529)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1530)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:55:38,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132846016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:38,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:55:38,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-28 03:55:38,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340510651] [2024-11-28 03:55:38,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:55:38,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:55:38,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:38,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:55:38,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=506, Unknown=11, NotChecked=196, Total=812 [2024-11-28 03:55:38,712 INFO L87 Difference]: Start difference. First operand 1385 states and 1743 transitions. Second operand has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 23 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:41,909 INFO L93 Difference]: Finished difference Result 1387 states and 1747 transitions. [2024-11-28 03:55:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:55:41,910 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 23 states have internal predecessors, (161), 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 101 [2024-11-28 03:55:41,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:41,914 INFO L225 Difference]: With dead ends: 1387 [2024-11-28 03:55:41,914 INFO L226 Difference]: Without dead ends: 1387 [2024-11-28 03:55:41,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=640, Unknown=11, NotChecked=220, Total=992 [2024-11-28 03:55:41,915 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 690 mSDsluCounter, 6327 mSDsCounter, 0 mSdLazyCounter, 4318 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 6827 SdHoareTripleChecker+Invalid, 4330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:41,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 6827 Invalid, 4330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4318 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-28 03:55:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-28 03:55:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1384. [2024-11-28 03:55:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1143 states have (on average 1.5126859142607174) internal successors, (1729), 1374 states have internal predecessors, (1729), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:55:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1741 transitions. [2024-11-28 03:55:41,936 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1741 transitions. Word has length 101 [2024-11-28 03:55:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:41,936 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1741 transitions. [2024-11-28 03:55:41,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.666666666666667) internal successors, (161), 23 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1741 transitions. [2024-11-28 03:55:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 03:55:41,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:41,938 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] [2024-11-28 03:55:41,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 03:55:42,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 03:55:42,139 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:42,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash -230371712, now seen corresponding path program 1 times [2024-11-28 03:55:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:42,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324574010] [2024-11-28 03:55:42,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:42,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324574010] [2024-11-28 03:55:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324574010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998362440] [2024-11-28 03:55:43,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:43,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:55:43,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:55:43,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:55:43,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:55:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:43,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 03:55:43,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:55:43,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:55:43,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:55:43,942 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:55:43,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:55:43,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:55:43,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:55:44,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:55:44,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:55:44,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:44,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:55:44,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:55:44,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:44,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:55:44,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:55:44,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:44,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:55:44,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:55:44,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:55:44,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:55:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:44,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:55:44,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1698 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-11-28 03:55:44,664 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1698 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-28 03:55:44,691 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1696) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1697))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1696) .cse1 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 03:55:44,712 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1697))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1696) .cse1 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1696) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1697) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-28 03:55:44,780 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1705))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1704) .cse0 v_ArrVal_1696) (select (select (store .cse1 .cse0 v_ArrVal_1697) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1698))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1705 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1705))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1697))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1704) .cse3 v_ArrVal_1696) .cse4 v_ArrVal_1698) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1699) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 03:55:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998362440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:44,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:55:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2024-11-28 03:55:44,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495257572] [2024-11-28 03:55:44,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:55:44,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:55:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:44,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:55:44,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=355, Unknown=5, NotChecked=210, Total=650 [2024-11-28 03:55:44,785 INFO L87 Difference]: Start difference. First operand 1384 states and 1741 transitions. Second operand has 19 states, 16 states have (on average 9.5625) internal successors, (153), 19 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:48,207 INFO L93 Difference]: Finished difference Result 1386 states and 1745 transitions. [2024-11-28 03:55:48,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:55:48,208 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.5625) internal successors, (153), 19 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2024-11-28 03:55:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:48,212 INFO L225 Difference]: With dead ends: 1386 [2024-11-28 03:55:48,212 INFO L226 Difference]: Without dead ends: 1386 [2024-11-28 03:55:48,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=591, Unknown=5, NotChecked=270, Total=992 [2024-11-28 03:55:48,213 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 699 mSDsluCounter, 4579 mSDsCounter, 0 mSdLazyCounter, 4401 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 4414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:48,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 5082 Invalid, 4414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4401 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-28 03:55:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-28 03:55:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1362. [2024-11-28 03:55:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1123 states have (on average 1.5191451469278718) internal successors, (1706), 1354 states have internal predecessors, (1706), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:55:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1716 transitions. [2024-11-28 03:55:48,232 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1716 transitions. Word has length 101 [2024-11-28 03:55:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:48,233 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1716 transitions. [2024-11-28 03:55:48,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.5625) internal successors, (153), 19 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1716 transitions. [2024-11-28 03:55:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 03:55:48,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:48,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:55:48,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:55:48,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:55:48,439 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:48,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash -632821940, now seen corresponding path program 1 times [2024-11-28 03:55:48,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372855] [2024-11-28 03:55:48,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:49,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372855] [2024-11-28 03:55:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:55:49,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:55:49,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:55:49,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124230982] [2024-11-28 03:55:49,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:55:49,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:55:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:49,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:55:49,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:55:49,140 INFO L87 Difference]: Start difference. First operand 1362 states and 1716 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:51,242 INFO L93 Difference]: Finished difference Result 1393 states and 1753 transitions. [2024-11-28 03:55:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:55:51,243 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-28 03:55:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:51,246 INFO L225 Difference]: With dead ends: 1393 [2024-11-28 03:55:51,247 INFO L226 Difference]: Without dead ends: 1393 [2024-11-28 03:55:51,247 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-28 03:55:51,247 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 741 mSDsluCounter, 4417 mSDsCounter, 0 mSdLazyCounter, 3040 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 4920 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:51,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 4920 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3040 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 03:55:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-11-28 03:55:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1389. [2024-11-28 03:55:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1149 states have (on average 1.5100087032201914) internal successors, (1735), 1379 states have internal predecessors, (1735), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:55:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1747 transitions. [2024-11-28 03:55:51,271 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1747 transitions. Word has length 103 [2024-11-28 03:55:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:51,272 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1747 transitions. [2024-11-28 03:55:51,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1747 transitions. [2024-11-28 03:55:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 03:55:51,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:51,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:55:51,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 03:55:51,273 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:51,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash -632821939, now seen corresponding path program 1 times [2024-11-28 03:55:51,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:51,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231484146] [2024-11-28 03:55:51,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:52,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:52,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231484146] [2024-11-28 03:55:52,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231484146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:55:52,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:55:52,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:55:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294800528] [2024-11-28 03:55:52,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:55:52,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:55:52,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:52,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:55:52,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:55:52,300 INFO L87 Difference]: Start difference. First operand 1389 states and 1747 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:54,229 INFO L93 Difference]: Finished difference Result 1392 states and 1751 transitions. [2024-11-28 03:55:54,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:55:54,229 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-28 03:55:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:54,233 INFO L225 Difference]: With dead ends: 1392 [2024-11-28 03:55:54,233 INFO L226 Difference]: Without dead ends: 1392 [2024-11-28 03:55:54,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:55:54,233 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 734 mSDsluCounter, 2503 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 3007 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:54,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 3007 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 03:55:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-11-28 03:55:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1389. [2024-11-28 03:55:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1149 states have (on average 1.5082680591818973) internal successors, (1733), 1379 states have internal predecessors, (1733), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:55:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1745 transitions. [2024-11-28 03:55:54,255 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1745 transitions. Word has length 103 [2024-11-28 03:55:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:54,256 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1745 transitions. [2024-11-28 03:55:54,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 13 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:55:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1745 transitions. [2024-11-28 03:55:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 03:55:54,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:54,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:55:54,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 03:55:54,258 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:54,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:54,258 INFO L85 PathProgramCache]: Analyzing trace with hash 354693433, now seen corresponding path program 1 times [2024-11-28 03:55:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:54,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885735086] [2024-11-28 03:55:54,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:54,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885735086] [2024-11-28 03:55:55,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885735086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:55,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816503330] [2024-11-28 03:55:55,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:55,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:55:55,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:55:55,148 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:55:55,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:55:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:55,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 03:55:55,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:55:55,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:55:55,651 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:55:55,651 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-28 03:55:55,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:55:55,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:55:55,966 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:55,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:55:56,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:56,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:55:56,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:56,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:55:56,223 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:55:56,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:55:56,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:55:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:56,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:55:56,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2036) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 03:55:56,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (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$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2034))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2035)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2036)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:55:56,478 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2034))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2035)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2036)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:55:56,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816503330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:56,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:55:56,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-28 03:55:56,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442382290] [2024-11-28 03:55:56,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:55:56,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 03:55:56,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:56,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 03:55:56,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=708, Unknown=51, NotChecked=174, Total=1056 [2024-11-28 03:55:56,592 INFO L87 Difference]: Start difference. First operand 1389 states and 1745 transitions. Second operand has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:55:59,576 INFO L93 Difference]: Finished difference Result 1391 states and 1749 transitions. [2024-11-28 03:55:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:55:59,576 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-11-28 03:55:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:55:59,579 INFO L225 Difference]: With dead ends: 1391 [2024-11-28 03:55:59,580 INFO L226 Difference]: Without dead ends: 1391 [2024-11-28 03:55:59,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=870, Unknown=53, NotChecked=192, Total=1260 [2024-11-28 03:55:59,581 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 687 mSDsluCounter, 6335 mSDsCounter, 0 mSdLazyCounter, 4290 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 6834 SdHoareTripleChecker+Invalid, 4303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:55:59,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 6834 Invalid, 4303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4290 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-28 03:55:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2024-11-28 03:55:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1388. [2024-11-28 03:55:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1149 states have (on average 1.5065274151436032) internal successors, (1731), 1378 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:55:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1743 transitions. [2024-11-28 03:55:59,602 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1743 transitions. Word has length 104 [2024-11-28 03:55:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:55:59,602 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1743 transitions. [2024-11-28 03:55:59,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.260869565217392) internal successors, (167), 25 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:55:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1743 transitions. [2024-11-28 03:55:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 03:55:59,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:55:59,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:55:59,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 03:55:59,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 03:55:59,809 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:55:59,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash 354693434, now seen corresponding path program 1 times [2024-11-28 03:55:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:59,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387775170] [2024-11-28 03:55:59,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:56:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:56:01,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387775170] [2024-11-28 03:56:01,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387775170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:56:01,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259636859] [2024-11-28 03:56:01,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:01,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:56:01,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:56:01,042 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:56:01,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:56:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:01,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 03:56:01,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:56:01,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:56:01,546 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:56:01,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:56:01,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:56:01,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:56:01,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:56:01,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:56:01,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:56:01,832 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:01,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:56:01,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:56:01,946 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:01,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:56:01,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:56:02,043 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:02,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:56:02,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:56:02,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:02,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:56:02,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:56:02,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:56:02,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:56:02,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-28 03:56:02,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:56:02,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 03:56:02,367 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2217) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2218))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2217) .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 03:56:02,387 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2218))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2217) .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2217) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-28 03:56:02,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2215))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2218))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2216) .cse0 v_ArrVal_2217) .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2215))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2216) .cse5 v_ArrVal_2217) (select (select (store .cse6 .cse5 v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2219))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-28 03:56:02,779 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2226))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2215))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2218))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2225) .cse0 v_ArrVal_2216) .cse1 v_ArrVal_2217) .cse2 v_ArrVal_2219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2225 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2226))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2215))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2225) .cse7 v_ArrVal_2216) .cse8 v_ArrVal_2217) (select (select (store .cse9 .cse8 v_ArrVal_2218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2219))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-28 03:56:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259636859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:56:02,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:56:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2024-11-28 03:56:02,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932947805] [2024-11-28 03:56:02,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:56:02,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 03:56:02,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:56:02,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 03:56:02,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=485, Unknown=24, NotChecked=250, Total=870 [2024-11-28 03:56:02,788 INFO L87 Difference]: Start difference. First operand 1388 states and 1743 transitions. Second operand has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 21 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:56:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:56:05,616 INFO L93 Difference]: Finished difference Result 1390 states and 1747 transitions. [2024-11-28 03:56:05,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:56:05,616 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 21 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2024-11-28 03:56:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:56:05,620 INFO L225 Difference]: With dead ends: 1390 [2024-11-28 03:56:05,620 INFO L226 Difference]: Without dead ends: 1390 [2024-11-28 03:56:05,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=810, Unknown=24, NotChecked=320, Total=1332 [2024-11-28 03:56:05,621 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 696 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 3023 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 3384 SdHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:56:05,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 3384 Invalid, 3041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3023 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 03:56:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-28 03:56:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1360. [2024-11-28 03:56:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1123 states have (on average 1.5155832591273375) internal successors, (1702), 1352 states have internal predecessors, (1702), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:56:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1712 transitions. [2024-11-28 03:56:05,637 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1712 transitions. Word has length 104 [2024-11-28 03:56:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:56:05,638 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1712 transitions. [2024-11-28 03:56:05,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 21 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:56:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1712 transitions. [2024-11-28 03:56:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 03:56:05,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:56:05,639 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-28 03:56:05,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:56:05,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-28 03:56:05,839 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:56:05,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:56:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash 459615374, now seen corresponding path program 1 times [2024-11-28 03:56:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:56:05,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119284247] [2024-11-28 03:56:05,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:05,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:56:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:56:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:56:06,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119284247] [2024-11-28 03:56:06,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119284247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:56:06,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:56:06,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 03:56:06,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009771657] [2024-11-28 03:56:06,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:56:06,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 03:56:06,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:56:06,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 03:56:06,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:56:06,799 INFO L87 Difference]: Start difference. First operand 1360 states and 1712 transitions. Second operand has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:56:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:56:09,295 INFO L93 Difference]: Finished difference Result 1399 states and 1757 transitions. [2024-11-28 03:56:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:56:09,295 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-28 03:56:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:56:09,300 INFO L225 Difference]: With dead ends: 1399 [2024-11-28 03:56:09,300 INFO L226 Difference]: Without dead ends: 1399 [2024-11-28 03:56:09,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-11-28 03:56:09,301 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 726 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 3387 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 5351 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:56:09,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 5351 Invalid, 3403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3387 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 03:56:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2024-11-28 03:56:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1395. [2024-11-28 03:56:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1157 states have (on average 1.5030250648228176) internal successors, (1739), 1385 states have internal predecessors, (1739), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:56:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1751 transitions. [2024-11-28 03:56:09,320 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1751 transitions. Word has length 107 [2024-11-28 03:56:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:56:09,321 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1751 transitions. [2024-11-28 03:56:09,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:56:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1751 transitions. [2024-11-28 03:56:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 03:56:09,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:56:09,322 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-28 03:56:09,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 03:56:09,323 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:56:09,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:56:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash 459615375, now seen corresponding path program 1 times [2024-11-28 03:56:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:56:09,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841786439] [2024-11-28 03:56:09,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:09,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:56:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:56:11,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:56:11,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841786439] [2024-11-28 03:56:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841786439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:56:11,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:56:11,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 03:56:11,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790858762] [2024-11-28 03:56:11,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:56:11,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:56:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:56:11,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:56:11,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:56:11,032 INFO L87 Difference]: Start difference. First operand 1395 states and 1751 transitions. Second operand has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:56:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:56:14,270 INFO L93 Difference]: Finished difference Result 1398 states and 1755 transitions. [2024-11-28 03:56:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:56:14,270 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2024-11-28 03:56:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:56:14,273 INFO L225 Difference]: With dead ends: 1398 [2024-11-28 03:56:14,273 INFO L226 Difference]: Without dead ends: 1398 [2024-11-28 03:56:14,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-28 03:56:14,274 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 739 mSDsluCounter, 3701 mSDsCounter, 0 mSdLazyCounter, 3735 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 3753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:56:14,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 4201 Invalid, 3753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3735 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-28 03:56:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-11-28 03:56:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1395. [2024-11-28 03:56:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1157 states have (on average 1.501296456352636) internal successors, (1737), 1385 states have internal predecessors, (1737), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:56:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1749 transitions. [2024-11-28 03:56:14,289 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1749 transitions. Word has length 107 [2024-11-28 03:56:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:56:14,290 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1749 transitions. [2024-11-28 03:56:14,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:56:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1749 transitions. [2024-11-28 03:56:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 03:56:14,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:56:14,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:56:14,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 03:56:14,291 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:56:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:56:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1711228933, now seen corresponding path program 1 times [2024-11-28 03:56:14,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:56:14,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388309265] [2024-11-28 03:56:14,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:56:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:56:15,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:56:15,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388309265] [2024-11-28 03:56:15,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388309265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:56:15,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811650636] [2024-11-28 03:56:15,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:15,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:56:15,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:56:15,374 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:56:15,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:56:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:15,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 03:56:15,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:56:15,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:56:15,976 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:56:15,976 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-28 03:56:16,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:56:16,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 03:56:16,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:16,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:56:16,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:16,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:56:16,553 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:16,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:56:16,641 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:16,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:56:16,769 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:16,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 03:56:16,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:56:16,903 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-28 03:56:16,903 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-28 03:56:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:56:16,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:56:18,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811650636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:56:18,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:56:18,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-28 03:56:18,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894024127] [2024-11-28 03:56:18,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:56:18,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 03:56:18,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:56:18,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 03:56:18,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1089, Unknown=54, NotChecked=0, Total=1332 [2024-11-28 03:56:18,048 INFO L87 Difference]: Start difference. First operand 1395 states and 1749 transitions. Second operand has 26 states, 23 states have (on average 7.608695652173913) internal successors, (175), 26 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:56:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:56:22,000 INFO L93 Difference]: Finished difference Result 1397 states and 1753 transitions. [2024-11-28 03:56:22,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:56:22,001 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.608695652173913) internal successors, (175), 26 states have internal predecessors, (175), 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 108 [2024-11-28 03:56:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:56:22,005 INFO L225 Difference]: With dead ends: 1397 [2024-11-28 03:56:22,006 INFO L226 Difference]: Without dead ends: 1397 [2024-11-28 03:56:22,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=203, Invalid=1149, Unknown=54, NotChecked=0, Total=1406 [2024-11-28 03:56:22,007 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 674 mSDsluCounter, 7265 mSDsCounter, 0 mSdLazyCounter, 4898 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 7766 SdHoareTripleChecker+Invalid, 4911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:56:22,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 7766 Invalid, 4911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4898 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 03:56:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-11-28 03:56:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1394. [2024-11-28 03:56:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1157 states have (on average 1.4995678478824546) internal successors, (1735), 1384 states have internal predecessors, (1735), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:56:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1747 transitions. [2024-11-28 03:56:22,032 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1747 transitions. Word has length 108 [2024-11-28 03:56:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:56:22,033 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1747 transitions. [2024-11-28 03:56:22,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.608695652173913) internal successors, (175), 26 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:56:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1747 transitions. [2024-11-28 03:56:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 03:56:22,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:56:22,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:56:22,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:56:22,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:56:22,240 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:56:22,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:56:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1711228932, now seen corresponding path program 1 times [2024-11-28 03:56:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:56:22,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906196988] [2024-11-28 03:56:22,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:56:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:56:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:56:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906196988] [2024-11-28 03:56:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906196988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:56:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013099584] [2024-11-28 03:56:24,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:24,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:56:24,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:56:24,171 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:56:24,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:56:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:24,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-28 03:56:24,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:56:24,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:56:24,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:56:24,675 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:56:24,676 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-28 03:56:24,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:56:24,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:56:24,924 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-28 03:56:24,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:56:25,157 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:25,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:56:25,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:56:25,353 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:25,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:56:25,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-28 03:56:25,498 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:25,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:56:25,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:56:25,629 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:25,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:56:25,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:56:25,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:56:25,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:56:25,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:56:25,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-28 03:56:25,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:56:25,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:56:25,883 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-28 03:56:25,904 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 03:56:25,904 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-28 03:56:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:56:25,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:56:49,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2788 (Array Int Int)) (v_ArrVal_2787 (Array Int Int)) (v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2800))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2787))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2788))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2799) .cse0 v_ArrVal_2786) .cse1 v_ArrVal_2789) .cse2 v_ArrVal_2790) (select (select (store .cse3 .cse2 v_ArrVal_2791) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2793))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 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_2800 (Array Int Int)) (v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2788 (Array Int Int)) (v_ArrVal_2787 (Array Int Int)) (v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (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_2794 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2800))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2787))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2788))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2791))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2799) .cse7 v_ArrVal_2786) .cse8 v_ArrVal_2789) .cse9 v_ArrVal_2790) .cse10 v_ArrVal_2793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2794) (select (select (store .cse11 .cse10 v_ArrVal_2792) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-28 03:56:49,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013099584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:56:49,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:56:49,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 28 [2024-11-28 03:56:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081712757] [2024-11-28 03:56:49,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:56:49,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 03:56:49,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:56:49,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 03:56:49,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1301, Unknown=62, NotChecked=76, Total=1640 [2024-11-28 03:56:49,532 INFO L87 Difference]: Start difference. First operand 1394 states and 1747 transitions. Second operand has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 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-28 03:57:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:57:20,149 INFO L93 Difference]: Finished difference Result 1396 states and 1751 transitions. [2024-11-28 03:57:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:57:20,150 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 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 108 [2024-11-28 03:57:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:57:20,153 INFO L225 Difference]: With dead ends: 1396 [2024-11-28 03:57:20,153 INFO L226 Difference]: Without dead ends: 1396 [2024-11-28 03:57:20,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=245, Invalid=1588, Unknown=63, NotChecked=84, Total=1980 [2024-11-28 03:57:20,154 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 676 mSDsluCounter, 6177 mSDsCounter, 0 mSdLazyCounter, 6013 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 6675 SdHoareTripleChecker+Invalid, 6027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 6013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:57:20,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 6675 Invalid, 6027 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 6013 Invalid, 0 Unknown, 0 Unchecked, 29.6s Time] [2024-11-28 03:57:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-28 03:57:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1358. [2024-11-28 03:57:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1123 states have (on average 1.5120213713268031) internal successors, (1698), 1350 states have internal predecessors, (1698), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:57:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1708 transitions. [2024-11-28 03:57:20,175 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1708 transitions. Word has length 108 [2024-11-28 03:57:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:57:20,175 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1708 transitions. [2024-11-28 03:57:20,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 28 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-28 03:57:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1708 transitions. [2024-11-28 03:57:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 03:57:20,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:57:20,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:57:20,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:57:20,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-28 03:57:20,378 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:57:20,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:57:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash 46538489, now seen corresponding path program 1 times [2024-11-28 03:57:20,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:57:20,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266873009] [2024-11-28 03:57:20,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:57:20,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:57:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:57:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:57:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:57:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266873009] [2024-11-28 03:57:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266873009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:57:21,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:57:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:57:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661114130] [2024-11-28 03:57:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:57:21,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:57:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:57:21,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:57:21,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:57:21,135 INFO L87 Difference]: Start difference. First operand 1358 states and 1708 transitions. Second operand has 7 states, 6 states have (on average 18.0) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:57:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:57:27,102 INFO L93 Difference]: Finished difference Result 1357 states and 1706 transitions. [2024-11-28 03:57:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:57:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.0) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-28 03:57:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:57:27,106 INFO L225 Difference]: With dead ends: 1357 [2024-11-28 03:57:27,106 INFO L226 Difference]: Without dead ends: 1357 [2024-11-28 03:57:27,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:57:27,107 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 2 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3573 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:57:27,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3573 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-28 03:57:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2024-11-28 03:57:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1357. [2024-11-28 03:57:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1123 states have (on average 1.510240427426536) internal successors, (1696), 1349 states have internal predecessors, (1696), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:57:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1706 transitions. [2024-11-28 03:57:27,128 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1706 transitions. Word has length 110 [2024-11-28 03:57:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:57:27,128 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1706 transitions. [2024-11-28 03:57:27,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.0) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:57:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1706 transitions. [2024-11-28 03:57:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 03:57:27,129 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:57:27,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:57:27,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 03:57:27,130 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:57:27,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:57:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash 46538490, now seen corresponding path program 1 times [2024-11-28 03:57:27,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:57:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173383195] [2024-11-28 03:57:27,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:57:27,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:57:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:57:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:57:31,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:57:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173383195] [2024-11-28 03:57:31,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173383195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:57:31,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:57:31,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 03:57:31,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91762951] [2024-11-28 03:57:31,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:57:31,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:57:31,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:57:31,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:57:31,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:57:31,011 INFO L87 Difference]: Start difference. First operand 1357 states and 1706 transitions. Second operand has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:57:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:57:44,138 INFO L93 Difference]: Finished difference Result 1401 states and 1755 transitions. [2024-11-28 03:57:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:57:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2024-11-28 03:57:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:57:44,143 INFO L225 Difference]: With dead ends: 1401 [2024-11-28 03:57:44,143 INFO L226 Difference]: Without dead ends: 1401 [2024-11-28 03:57:44,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 03:57:44,144 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 735 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:57:44,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 2645 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2024-11-28 03:57:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2024-11-28 03:57:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1398. [2024-11-28 03:57:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1163 states have (on average 1.4935511607910577) internal successors, (1737), 1388 states have internal predecessors, (1737), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-28 03:57:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1749 transitions. [2024-11-28 03:57:44,166 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1749 transitions. Word has length 110 [2024-11-28 03:57:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:57:44,166 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1749 transitions. [2024-11-28 03:57:44,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:57:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1749 transitions. [2024-11-28 03:57:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-28 03:57:44,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:57:44,168 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] [2024-11-28 03:57:44,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 03:57:44,168 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:57:44,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:57:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2041331821, now seen corresponding path program 1 times [2024-11-28 03:57:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:57:44,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888589490] [2024-11-28 03:57:44,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:57:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:57:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:57:48,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-28 03:57:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:57:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888589490] [2024-11-28 03:57:48,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888589490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:57:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485745602] [2024-11-28 03:57:48,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:57:48,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:57:48,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:57:48,293 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:57:48,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:57:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:57:48,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 03:57:48,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:57:48,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:57:49,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:57:49,613 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:57:49,613 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-28 03:57:49,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:57:49,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 03:57:50,574 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-28 03:57:50,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:57:51,541 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:57:51,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:57:51,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:57:52,176 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:57:52,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:57:52,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:57:52,679 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:57:52,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:57:52,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:57:53,193 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:57:53,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:57:53,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-28 03:57:53,690 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:57:53,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 03:57:53,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:57:54,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:57:54,193 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-28 03:57:54,300 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 03:57:54,300 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-28 03:57:54,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:57:54,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 03:57:54,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-28 03:57:54,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 03:57:54,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:57:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:57:54,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:57:55,068 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3198 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 03:57:55,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3194 (Array Int Int))) (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3195))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3194) .cse0 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse2 .cse0 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3194) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3198) |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)))))) is different from false [2024-11-28 03:57:56,768 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3192))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_3195))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3193) .cse1 v_ArrVal_3194) .cse2 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse4 .cse2 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3192))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3193) .cse6 v_ArrVal_3194) (select (select (store .cse7 .cse6 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3198))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (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))))))) is different from false [2024-11-28 03:57:56,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3190))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3192))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3191) .cse0 v_ArrVal_3193) .cse1 v_ArrVal_3194) (select (select (store .cse2 .cse1 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3198))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 40))) (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_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3190))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3192))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3195))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3191) .cse5 v_ArrVal_3193) .cse6 v_ArrVal_3194) .cse7 v_ArrVal_3198) |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_3196) (select (select (store .cse8 .cse7 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-28 03:58:08,579 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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_3195 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3188))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3190))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3192))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3189) .cse0 v_ArrVal_3191) .cse1 v_ArrVal_3193) .cse2 v_ArrVal_3194) (select (select (store .cse3 .cse2 v_ArrVal_3195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3198))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (forall ((v_ArrVal_3195 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (or (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3188))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3190))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3192))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3195))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3189) .cse7 v_ArrVal_3191) .cse8 v_ArrVal_3193) .cse9 v_ArrVal_3194) .cse10 v_ArrVal_3198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3196) (select (select (store .cse11 .cse10 v_ArrVal_3197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2024-11-28 03:58:39,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485745602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:58:39,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:58:39,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 29 [2024-11-28 03:58:39,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424219889] [2024-11-28 03:58:39,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:58:39,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 03:58:39,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:39,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 03:58:39,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1228, Unknown=42, NotChecked=390, Total=1892 [2024-11-28 03:58:39,612 INFO L87 Difference]: Start difference. First operand 1398 states and 1749 transitions. Second operand has 30 states, 27 states have (on average 6.666666666666667) internal successors, (180), 29 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:59:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:59:11,292 INFO L93 Difference]: Finished difference Result 1400 states and 1753 transitions. [2024-11-28 03:59:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:59:11,294 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.666666666666667) internal successors, (180), 29 states have internal predecessors, (180), 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 111 [2024-11-28 03:59:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:59:11,298 INFO L225 Difference]: With dead ends: 1400 [2024-11-28 03:59:11,298 INFO L226 Difference]: Without dead ends: 1400 [2024-11-28 03:59:11,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 48.6s TimeCoverageRelationStatistics Valid=258, Invalid=1442, Unknown=42, NotChecked=420, Total=2162 [2024-11-28 03:59:11,299 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 678 mSDsluCounter, 4213 mSDsCounter, 0 mSdLazyCounter, 4103 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 4710 SdHoareTripleChecker+Invalid, 4122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:59:11,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 4710 Invalid, 4122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4103 Invalid, 0 Unknown, 0 Unchecked, 30.7s Time] [2024-11-28 03:59:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-11-28 03:59:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1356. [2024-11-28 03:59:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1123 states have (on average 1.508459483526269) internal successors, (1694), 1348 states have internal predecessors, (1694), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:59:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1704 transitions. [2024-11-28 03:59:11,315 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1704 transitions. Word has length 111 [2024-11-28 03:59:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:59:11,315 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1704 transitions. [2024-11-28 03:59:11,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.666666666666667) internal successors, (180), 29 states have internal predecessors, (180), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:59:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1704 transitions. [2024-11-28 03:59:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 03:59:11,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:59:11,316 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-28 03:59:11,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 03:59:11,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:11,516 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:59:11,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash -845632555, now seen corresponding path program 1 times [2024-11-28 03:59:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73415107] [2024-11-28 03:59:11,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:59:13,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:13,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73415107] [2024-11-28 03:59:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73415107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:59:13,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:59:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:59:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510072891] [2024-11-28 03:59:13,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:59:13,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:59:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:13,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:59:13,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:59:13,891 INFO L87 Difference]: Start difference. First operand 1356 states and 1704 transitions. Second operand has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:59:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:59:28,628 INFO L93 Difference]: Finished difference Result 1355 states and 1702 transitions. [2024-11-28 03:59:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:59:28,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-28 03:59:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:59:28,631 INFO L225 Difference]: With dead ends: 1355 [2024-11-28 03:59:28,631 INFO L226 Difference]: Without dead ends: 1355 [2024-11-28 03:59:28,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:59:28,632 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 748 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:59:28,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 2936 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 13.9s Time] [2024-11-28 03:59:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2024-11-28 03:59:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2024-11-28 03:59:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1123 states have (on average 1.5066785396260018) internal successors, (1692), 1347 states have internal predecessors, (1692), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:59:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1702 transitions. [2024-11-28 03:59:28,643 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1702 transitions. Word has length 113 [2024-11-28 03:59:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:59:28,643 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1702 transitions. [2024-11-28 03:59:28,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:59:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1702 transitions. [2024-11-28 03:59:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-28 03:59:28,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:59:28,644 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-28 03:59:28,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 03:59:28,644 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:59:28,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash -845632554, now seen corresponding path program 1 times [2024-11-28 03:59:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823952603] [2024-11-28 03:59:28,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:59:33,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:33,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823952603] [2024-11-28 03:59:33,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823952603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:59:33,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:59:33,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:59:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320827435] [2024-11-28 03:59:33,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:59:33,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:59:33,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:33,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:59:33,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:59:33,049 INFO L87 Difference]: Start difference. First operand 1355 states and 1702 transitions. Second operand has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:59:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:59:53,176 INFO L93 Difference]: Finished difference Result 1354 states and 1700 transitions. [2024-11-28 03:59:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:59:53,177 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-28 03:59:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:59:53,180 INFO L225 Difference]: With dead ends: 1354 [2024-11-28 03:59:53,180 INFO L226 Difference]: Without dead ends: 1354 [2024-11-28 03:59:53,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:59:53,181 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 1454 mSDsluCounter, 2611 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 2484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:59:53,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 3109 Invalid, 2484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 18.9s Time] [2024-11-28 03:59:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-11-28 03:59:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2024-11-28 03:59:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1123 states have (on average 1.5048975957257347) internal successors, (1690), 1346 states have internal predecessors, (1690), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:59:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1700 transitions. [2024-11-28 03:59:53,199 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1700 transitions. Word has length 113 [2024-11-28 03:59:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:59:53,199 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1700 transitions. [2024-11-28 03:59:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:59:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1700 transitions. [2024-11-28 03:59:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-28 03:59:53,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:59:53,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, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:59:53,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-28 03:59:53,201 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:59:53,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:53,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2039410445, now seen corresponding path program 1 times [2024-11-28 03:59:53,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:53,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102538188] [2024-11-28 03:59:53,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:53,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:59:53,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:53,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102538188] [2024-11-28 03:59:53,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102538188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:59:53,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:59:53,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:59:53,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984357733] [2024-11-28 03:59:53,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:59:53,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:59:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:53,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:59:53,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:59:53,620 INFO L87 Difference]: Start difference. First operand 1354 states and 1700 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-28 03:59:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:59:59,078 INFO L93 Difference]: Finished difference Result 1353 states and 1698 transitions. [2024-11-28 03:59:59,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:59:59,079 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-28 03:59:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:59:59,081 INFO L225 Difference]: With dead ends: 1353 [2024-11-28 03:59:59,081 INFO L226 Difference]: Without dead ends: 1353 [2024-11-28 03:59:59,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:59:59,082 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 5 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:59:59,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2417 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-28 03:59:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-28 03:59:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-11-28 03:59:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1123 states have (on average 1.5031166518254675) internal successors, (1688), 1345 states have internal predecessors, (1688), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 03:59:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1698 transitions. [2024-11-28 03:59:59,100 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1698 transitions. Word has length 116 [2024-11-28 03:59:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:59:59,100 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1698 transitions. [2024-11-28 03:59:59,101 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-28 03:59:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1698 transitions. [2024-11-28 03:59:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-28 03:59:59,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:59:59,102 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-28 03:59:59,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-28 03:59:59,102 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 03:59:59,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:59,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2039410446, now seen corresponding path program 1 times [2024-11-28 03:59:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:59,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025261844] [2024-11-28 03:59:59,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:59,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:59:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:59,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025261844] [2024-11-28 03:59:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025261844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:59:59,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:59:59,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:59:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396157433] [2024-11-28 03:59:59,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:59:59,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:59:59,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:59,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:59:59,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:59:59,598 INFO L87 Difference]: Start difference. First operand 1353 states and 1698 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-28 04:00:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:05,613 INFO L93 Difference]: Finished difference Result 1352 states and 1696 transitions. [2024-11-28 04:00:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:00:05,614 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-28 04:00:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:05,615 INFO L225 Difference]: With dead ends: 1352 [2024-11-28 04:00:05,615 INFO L226 Difference]: Without dead ends: 1352 [2024-11-28 04:00:05,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:00:05,616 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 4 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:05,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2375 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-28 04:00:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-11-28 04:00:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2024-11-28 04:00:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1123 states have (on average 1.5013357079252003) internal successors, (1686), 1344 states have internal predecessors, (1686), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:00:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1696 transitions. [2024-11-28 04:00:05,633 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1696 transitions. Word has length 116 [2024-11-28 04:00:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:05,633 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1696 transitions. [2024-11-28 04:00:05,633 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-28 04:00:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1696 transitions. [2024-11-28 04:00:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 04:00:05,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:05,635 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-28 04:00:05,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-28 04:00:05,635 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 04:00:05,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:05,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1202784935, now seen corresponding path program 1 times [2024-11-28 04:00:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:05,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562076128] [2024-11-28 04:00:05,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:05,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:00:10,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:10,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562076128] [2024-11-28 04:00:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562076128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:10,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:10,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 04:00:10,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387619956] [2024-11-28 04:00:10,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:10,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:00:10,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:10,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:00:10,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:00:10,065 INFO L87 Difference]: Start difference. First operand 1352 states and 1696 transitions. Second operand has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:00:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:35,595 INFO L93 Difference]: Finished difference Result 1435 states and 1795 transitions. [2024-11-28 04:00:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 04:00:35,595 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 1 states have call successors, (1), 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 117 [2024-11-28 04:00:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:35,597 INFO L225 Difference]: With dead ends: 1435 [2024-11-28 04:00:35,597 INFO L226 Difference]: Without dead ends: 1435 [2024-11-28 04:00:35,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-28 04:00:35,598 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 772 mSDsluCounter, 4430 mSDsCounter, 0 mSdLazyCounter, 3197 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 4927 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:35,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 4927 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 23.3s Time] [2024-11-28 04:00:35,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-11-28 04:00:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1407. [2024-11-28 04:00:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1177 states have (on average 1.4791843670348344) internal successors, (1741), 1397 states have internal predecessors, (1741), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-28 04:00:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1757 transitions. [2024-11-28 04:00:35,613 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1757 transitions. Word has length 117 [2024-11-28 04:00:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:35,613 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1757 transitions. [2024-11-28 04:00:35,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:00:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1757 transitions. [2024-11-28 04:00:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-28 04:00:35,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:35,614 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-28 04:00:35,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-28 04:00:35,614 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 04:00:35,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:35,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1202784934, now seen corresponding path program 1 times [2024-11-28 04:00:35,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:35,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879714156] [2024-11-28 04:00:35,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:35,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:00:40,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:40,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879714156] [2024-11-28 04:00:40,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879714156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:40,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 04:00:40,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940404306] [2024-11-28 04:00:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:40,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:00:40,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:40,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:00:40,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:00:40,646 INFO L87 Difference]: Start difference. First operand 1407 states and 1757 transitions. Second operand has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:01:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:01:10,926 INFO L93 Difference]: Finished difference Result 1434 states and 1793 transitions. [2024-11-28 04:01:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 04:01:10,926 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 1 states have call successors, (1), 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 117 [2024-11-28 04:01:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:01:10,928 INFO L225 Difference]: With dead ends: 1434 [2024-11-28 04:01:10,928 INFO L226 Difference]: Without dead ends: 1434 [2024-11-28 04:01:10,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-28 04:01:10,929 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 802 mSDsluCounter, 4462 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 4957 SdHoareTripleChecker+Invalid, 3847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:01:10,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 4957 Invalid, 3847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 27.9s Time] [2024-11-28 04:01:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2024-11-28 04:01:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1407. [2024-11-28 04:01:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1175 states have (on average 1.48) internal successors, (1739), 1397 states have internal predecessors, (1739), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-28 04:01:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1755 transitions. [2024-11-28 04:01:10,942 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1755 transitions. Word has length 117 [2024-11-28 04:01:10,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:01:10,942 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1755 transitions. [2024-11-28 04:01:10,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.388888888888889) internal successors, (115), 19 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:01:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1755 transitions. [2024-11-28 04:01:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:01:10,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:01:10,943 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, 1] [2024-11-28 04:01:10,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-28 04:01:10,944 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 04:01:10,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:10,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2087134074, now seen corresponding path program 1 times [2024-11-28 04:01:10,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:10,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113918273] [2024-11-28 04:01:10,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:01:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113918273] [2024-11-28 04:01:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113918273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:01:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806573978] [2024-11-28 04:01:15,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:15,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:15,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:15,579 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:01:15,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:01:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:16,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 04:01:16,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:01:16,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:01:17,164 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:01:17,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:01:17,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:01:17,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:01:18,202 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:01:18,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:01:18,219 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-28 04:01:18,612 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:01:18,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:01:18,629 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-28 04:01:19,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:01:19,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:01:19,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-28 04:01:19,482 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:01:19,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:01:19,514 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-28 04:01:19,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:01:19,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:01:19,954 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-28 04:01:20,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:01:20,878 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 04:01:20,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 04:01:20,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-28 04:01:21,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:01:21,874 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 04:01:21,874 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-28 04:01:21,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-28 04:01:22,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-28 04:01:22,464 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-28 04:01:22,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-28 04:01:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:01:22,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:01:22,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (or (= 1 (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= v_ArrVal_4017 (let ((.cse2 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base|) .cse2 (select v_ArrVal_4017 .cse2))))))) is different from false [2024-11-28 04:01:22,726 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse2 (select v_ArrVal_4017 .cse2))) v_ArrVal_4017)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_4017))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1))))) is different from false [2024-11-28 04:01:22,927 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.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 ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4015))) (or (= (select |c_#valid| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:01:22,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 184 [2024-11-28 04:01:23,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.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_12|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4015)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4017 (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4017 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))) is different from false [2024-11-28 04:01:23,250 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse6 (store (select |c_#memory_$Pointer$#2.base| .cse6) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#2.offset| .cse6 v_ArrVal_4015))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 04:01:23,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4013)) (.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$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4012))) (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_12|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4015)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))))))))) is different from false [2024-11-28 04:01:23,858 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4012))) (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_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4015))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-28 04:01:24,397 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4010)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4011) .cse9 v_ArrVal_4012))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4017))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4017 .cse5))) v_ArrVal_4017)))))))))) is different from false [2024-11-28 04:01:24,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4010))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4011) .cse10 v_ArrVal_4012))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4017))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4017 .cse5))))))))))))))) is different from false [2024-11-28 04:01:24,874 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4009)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4010))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4008) .cse9 v_ArrVal_4011) .cse10 v_ArrVal_4012))) (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_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4017 .cse4))) v_ArrVal_4017)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-28 04:01:25,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4009))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4010))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4008) .cse10 v_ArrVal_4011) .cse11 v_ArrVal_4012))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4017))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4017 .cse5))))))))))))))))) is different from false [2024-11-28 04:01:25,405 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4006 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4007 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4006)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4009))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4010))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4007) .cse9 v_ArrVal_4008) .cse10 v_ArrVal_4011) .cse11 v_ArrVal_4012))) (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_12|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4015))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4017 (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4017 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-28 04:01:25,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4006 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4007 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_4006))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4009))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4010))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_4007) .cse10 v_ArrVal_4008) .cse11 v_ArrVal_4011) .cse12 v_ArrVal_4012))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc61#1.base_12|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4015)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4017 (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4017 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))))) is different from false [2024-11-28 04:01:26,230 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_10| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_12| Int) (v_ArrVal_4010 (Array Int Int)) (v_ArrVal_4011 (Array Int Int)) (v_ArrVal_4023 (Array Int Int)) (v_ArrVal_4012 (Array Int Int)) (v_ArrVal_4024 (Array Int Int)) (v_ArrVal_4013 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4006 (Array Int Int)) (v_ArrVal_4017 (Array Int Int)) (v_ArrVal_4007 (Array Int Int)) (v_ArrVal_4018 (Array Int Int)) (v_ArrVal_4008 (Array Int Int)) (v_ArrVal_4009 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4023)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4006))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4009))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4010))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4013))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4024) .cse9 v_ArrVal_4007) .cse10 v_ArrVal_4008) .cse11 v_ArrVal_4011) .cse12 v_ArrVal_4012))) (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_12|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4015)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_10| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4017 (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_10| 40))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4017 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_12| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4017))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-11-28 04:01:26,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806573978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:01:26,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:01:26,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2024-11-28 04:01:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702878788] [2024-11-28 04:01:26,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:01:26,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 04:01:26,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:26,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 04:01:26,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=960, Unknown=14, NotChecked=1050, Total=2162 [2024-11-28 04:01:26,243 INFO L87 Difference]: Start difference. First operand 1407 states and 1755 transitions. Second operand has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:02:08,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:02:08,036 INFO L93 Difference]: Finished difference Result 1431 states and 1789 transitions. [2024-11-28 04:02:08,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:02:08,037 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-28 04:02:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:02:08,039 INFO L225 Difference]: With dead ends: 1431 [2024-11-28 04:02:08,039 INFO L226 Difference]: Without dead ends: 1431 [2024-11-28 04:02:08,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=256, Invalid=1948, Unknown=14, NotChecked=1442, Total=3660 [2024-11-28 04:02:08,040 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 717 mSDsluCounter, 8296 mSDsCounter, 0 mSdLazyCounter, 5459 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 8793 SdHoareTripleChecker+Invalid, 5481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:02:08,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 8793 Invalid, 5481 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5459 Invalid, 0 Unknown, 0 Unchecked, 38.5s Time] [2024-11-28 04:02:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2024-11-28 04:02:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1406. [2024-11-28 04:02:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1175 states have (on average 1.4782978723404254) internal successors, (1737), 1396 states have internal predecessors, (1737), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-28 04:02:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1753 transitions. [2024-11-28 04:02:08,053 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1753 transitions. Word has length 118 [2024-11-28 04:02:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:02:08,054 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 1753 transitions. [2024-11-28 04:02:08,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:02:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1753 transitions. [2024-11-28 04:02:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:02:08,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:02:08,054 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, 1] [2024-11-28 04:02:08,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 04:02:08,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:08,255 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 04:02:08,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2087134073, now seen corresponding path program 1 times [2024-11-28 04:02:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:08,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399872233] [2024-11-28 04:02:08,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:02:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:02:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:02:13,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:02:13,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399872233] [2024-11-28 04:02:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399872233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:02:13,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299114453] [2024-11-28 04:02:13,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:02:13,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:13,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:02:13,076 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:02:13,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:02:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:02:13,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-28 04:02:13,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:02:13,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:02:14,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:02:14,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:02:14,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:02:14,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:02:15,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:02:15,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:02:15,626 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-28 04:02:16,005 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:02:16,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:02:16,035 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-28 04:02:16,426 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:02:16,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:02:16,457 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-28 04:02:16,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:02:16,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:02:16,889 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-28 04:02:17,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:02:17,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:02:17,355 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-28 04:02:17,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:02:18,274 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 04:02:18,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 04:02:18,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-28 04:02:19,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:02:19,299 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 04:02:19,299 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-28 04:02:19,417 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-28 04:02:19,417 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-28 04:02:20,131 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-28 04:02:20,131 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-28 04:02:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:02:20,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:02:21,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse3 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (and (forall ((v_ArrVal_4250 (Array Int Int))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (< 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4249))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store .cse2 .cse3 (select v_ArrVal_4249 .cse3)) v_ArrVal_4249)))) (not (= (store .cse4 .cse3 (select v_ArrVal_4250 .cse3)) v_ArrVal_4250)))) (forall ((v_ArrVal_4250 (Array Int Int))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4249)) (.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4250))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ 383 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))))) (not (= (store .cse2 .cse3 (select v_ArrVal_4249 .cse3)) v_ArrVal_4249)))) (not (= (store .cse4 .cse3 (select v_ArrVal_4250 .cse3)) v_ArrVal_4250)))))) is different from false [2024-11-28 04:02:21,614 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse0 (select |c_#memory_$Pointer$#2.offset| .cse7)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_4249 .cse1)) v_ArrVal_4249)) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_4249)) (.cse5 (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_4250))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (< (+ 383 (select (select .cse2 .cse3) .cse4)) (select |c_#length| (select (select .cse5 .cse3) .cse4))))))) (not (= v_ArrVal_4250 (store .cse8 .cse1 (select v_ArrVal_4250 .cse1))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse9))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (not (= v_ArrVal_4250 (store .cse8 .cse10 (select v_ArrVal_4250 .cse10)))) (forall ((v_ArrVal_4249 (Array Int Int))) (or (not (= (store .cse0 .cse10 (select v_ArrVal_4249 .cse10)) v_ArrVal_4249)) (< 0 (+ (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| .cse7 v_ArrVal_4249))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#2.base| .cse7 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1))))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse9))))))) is different from false [2024-11-28 04:02:22,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.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|))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse8 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.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 ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse9 (select .cse8 .cse7)) (.cse11 (select .cse6 .cse7))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse0) (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (let ((.cse1 (store .cse8 .cse7 v_ArrVal_4249)) (.cse4 (store .cse6 .cse7 v_ArrVal_4250))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select .cse1 .cse2) .cse3) 383) (select |c_#length| (select (select .cse4 .cse2) .cse3))))) (not (= v_ArrVal_4249 (store .cse9 .cse10 (select v_ArrVal_4249 .cse10)))))) (not (= v_ArrVal_4250 (store .cse11 .cse10 (select v_ArrVal_4250 .cse10))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse0) (forall ((v_ArrVal_4250 (Array Int Int))) (let ((.cse12 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (forall ((v_ArrVal_4249 (Array Int Int))) (or (not (= v_ArrVal_4249 (store .cse9 .cse12 (select v_ArrVal_4249 .cse12)))) (< 0 (+ (let ((.cse13 (store .cse8 .cse7 v_ArrVal_4249))) (select (select .cse13 (select (select (store .cse6 .cse7 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)))) (not (= v_ArrVal_4250 (store .cse11 .cse12 (select v_ArrVal_4250 .cse12))))))))))))) is different from false [2024-11-28 04:02:22,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 757 treesize of output 664 [2024-11-28 04:02:23,991 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| 0))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base|))) (and (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.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_15|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 v_prenex_40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse0 (store .cse2 .cse3 v_prenex_42))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_prenex_42 (store (select .cse2 .cse3) .cse5 (select v_prenex_42 .cse5)))) (not (= v_prenex_41 (store (select .cse4 .cse3) .cse5 (select v_prenex_41 .cse5)))) (< v_prenex_40 .cse6))))) (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#2.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_15|)))) (let ((.cse10 (+ 40 v_prenex_40)) (.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_prenex_42 (store (select .cse8 .cse9) .cse10 (select v_prenex_42 .cse10)))) (not (= v_prenex_41 (store (select .cse4 .cse9) .cse10 (select v_prenex_41 .cse10)))) (< (let ((.cse11 (store .cse4 .cse9 v_prenex_41))) (select (select .cse11 (select (select (store .cse8 .cse9 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< v_prenex_40 .cse6))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.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_15|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ (let ((.cse12 (store .cse4 .cse14 v_ArrVal_4249))) (select (select .cse12 (select (select (store .cse13 .cse14 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| .cse6) (not (= (store (select .cse4 .cse14) .cse15 (select v_ArrVal_4249 .cse15)) v_ArrVal_4249)) (not (= (store (select .cse13 .cse14) .cse15 (select v_ArrVal_4250 .cse15)) v_ArrVal_4250))))))))) is different from false [2024-11-28 04:02:27,092 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4244)) (.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4245))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse5 (+ 40 v_prenex_40))) (or (< (let ((.cse0 (store .cse4 .cse2 v_prenex_41))) (select (select .cse0 (select (select (store .cse1 .cse2 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (< v_prenex_40 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse1 .cse2) .cse5 (select v_prenex_42 .cse5)) v_prenex_42)) (not (= v_prenex_41 (store (select .cse4 .cse2) .cse5 (select v_prenex_41 .cse5)))))))))) (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4244)) (.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4245))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse13 (+ 40 v_prenex_40)) (.cse10 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (< v_prenex_40 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse11 .cse12) .cse13 (select v_prenex_42 .cse13)) v_prenex_42)) (not (= v_prenex_41 (store (select .cse10 .cse12) .cse13 (select v_prenex_41 .cse13)))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse14 (store .cse11 .cse12 v_prenex_42))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse10 .cse12 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4244)) (.cse27 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4245))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse22 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse23 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ 1 (let ((.cse19 (store .cse22 .cse21 v_ArrVal_4249))) (select (select .cse19 (select (select (store .cse20 .cse21 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (select .cse20 .cse21) .cse23 (select v_ArrVal_4250 .cse23)) v_ArrVal_4250)) (not (= v_ArrVal_4249 (store (select .cse22 .cse21) .cse23 (select v_ArrVal_4249 .cse23)))))))))))) is different from false [2024-11-28 04:02:28,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4244)) (.cse2 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4245))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0)))) (or (not (= (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4245 .cse4 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4250 .cse5)) v_ArrVal_4250)) (not (= v_ArrVal_4249 (store (select .cse6 .cse7) .cse5 (select v_ArrVal_4249 .cse5)))) (< 0 (+ (let ((.cse8 (store .cse6 .cse7 v_ArrVal_4249))) (select (select .cse8 (select (select (store .cse9 .cse7 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4244)) (.cse20 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4245))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse20 .cse17 (store (select .cse20 .cse17) .cse18 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse19 (+ 40 v_prenex_40)) (.cse15 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 0)))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse12 (store .cse13 .cse14 v_prenex_42))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse15 .cse14 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select (store .cse16 .cse17 (store v_ArrVal_4244 .cse18 0)) .cse14) .cse19 (select v_prenex_41 .cse19)) v_prenex_41)) (not (= (store (select .cse13 .cse14) .cse19 (select v_prenex_42 .cse19)) v_prenex_42)) (< v_prenex_40 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse30 (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_4244)) (.cse27 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_4245))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse27 .cse28 (store (select .cse27 .cse28) .cse29 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (+ 40 v_prenex_40)) (.cse24 (store .cse30 .cse28 (store (select .cse30 .cse28) .cse29 0)))) (or (< (let ((.cse21 (store .cse24 .cse23 v_prenex_41))) (select (select .cse21 (select (select (store .cse22 .cse23 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_prenex_41 (store (select .cse24 .cse23) .cse25 (select v_prenex_41 .cse25)))) (not (= (store (let ((.cse26 (store .cse27 .cse28 (store v_ArrVal_4245 .cse29 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse25 (select v_prenex_42 .cse25)) v_prenex_42)) (< v_prenex_40 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-28 04:02:29,630 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse7 (store .cse11 .cse12 v_ArrVal_4245))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse0 (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 0))) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse3 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_41 (store (select .cse0 .cse2) .cse3 (select v_prenex_41 .cse3)))) (< (let ((.cse4 (store .cse0 .cse2 v_prenex_41))) (select (select .cse4 (select (select (store .cse5 .cse2 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_prenex_42 (store (let ((.cse6 (store .cse7 .cse8 (store v_ArrVal_4245 .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse3 (select v_prenex_42 .cse3)))))))))))) (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4243))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4242) .cse23 v_ArrVal_4244)) (.cse21 (store .cse22 .cse23 v_ArrVal_4245))) (let ((.cse14 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse15 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse21 .cse14 (store (select .cse21 .cse14) .cse15 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse17 (+ 40 v_prenex_40)) (.cse18 (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 0))) (.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select (store .cse13 .cse14 (store v_ArrVal_4244 .cse15 0)) .cse16) .cse17 (select v_prenex_41 .cse17)) v_prenex_41)) (< v_prenex_40 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse19 .cse16) .cse17 (select v_prenex_42 .cse17)) v_prenex_42)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse20 (store .cse19 .cse16 v_prenex_42))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse18 .cse16 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4243))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4242) .cse35 v_ArrVal_4244)) (.cse28 (store .cse34 .cse35 v_ArrVal_4245))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse30 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store .cse28 .cse29 (store (select .cse28 .cse29) .cse30 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse26 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse25 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse24 (store .cse33 .cse29 (store (select .cse33 .cse29) .cse30 0)))) (or (not (= (store (select .cse24 .cse25) .cse26 (select v_ArrVal_4249 .cse26)) v_ArrVal_4249)) (not (= (store (let ((.cse27 (store .cse28 .cse29 (store v_ArrVal_4245 .cse30 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse26 (select v_ArrVal_4250 .cse26)) v_ArrVal_4250)) (< 0 (+ (let ((.cse31 (store .cse24 .cse25 v_ArrVal_4249))) (select (select .cse31 (select (select (store .cse32 .cse25 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-28 04:02:30,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4243))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4242) .cse11 v_ArrVal_4244)) (.cse9 (store .cse10 .cse11 v_ArrVal_4245))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse4 (+ 40 v_prenex_40)) (.cse5 (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) (.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (or (not (= (store (select (store .cse0 .cse1 (store v_ArrVal_4244 .cse2 0)) .cse3) .cse4 (select v_prenex_41 .cse4)) v_prenex_41)) (< v_prenex_40 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (not (= v_prenex_42 (store (select .cse7 .cse3) .cse4 (select v_prenex_42 .cse4)))) (= (select (let ((.cse8 (store .cse7 .cse3 v_prenex_42))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (select (select (store .cse5 .cse3 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) |v_ULTIMATE.start_main_#t~malloc61#1.base_15|))))))))) (forall ((v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4243))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse22 (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4242) .cse24 v_ArrVal_4244)) (.cse15 (store .cse23 .cse24 v_ArrVal_4245))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse20 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse13 (store .cse22 .cse16 (store (select .cse22 .cse16) .cse17 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse18 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (not (= v_prenex_42 (store (let ((.cse14 (store .cse15 .cse16 (store v_ArrVal_4245 .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse18 (select v_prenex_42 .cse18)))) (< (let ((.cse19 (store .cse13 .cse21 v_prenex_41))) (select (select .cse19 (select (select (store .cse20 .cse21 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1) (not (= (store (select .cse13 .cse21) .cse18 (select v_prenex_41 .cse18)) v_prenex_41)))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4243))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse34 (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4242) .cse36 v_ArrVal_4244)) (.cse29 (store .cse35 .cse36 v_ArrVal_4245))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse33 (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse27 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse25 (store .cse34 .cse30 (store (select .cse34 .cse30) .cse31 0))) (.cse26 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (or (not (= v_ArrVal_4249 (store (select .cse25 .cse26) .cse27 (select v_ArrVal_4249 .cse27)))) (not (= (store (let ((.cse28 (store .cse29 .cse30 (store v_ArrVal_4245 .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse27 (select v_ArrVal_4250 .cse27)) v_ArrVal_4250)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (< 0 (+ (let ((.cse32 (store .cse25 .cse26 v_ArrVal_4249))) (select (select .cse32 (select (select (store .cse33 .cse26 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1))))))))))))) is different from false [2024-11-28 04:02:32,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4240))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4241) .cse13 v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse6 (store .cse11 .cse12 v_ArrVal_4245))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse9 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ (let ((.cse0 (store .cse4 .cse2 v_ArrVal_4249))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= (store (let ((.cse5 (store .cse6 .cse7 (store v_ArrVal_4245 .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse9 (select v_ArrVal_4250 .cse9)) v_ArrVal_4250)) (not (= v_ArrVal_4249 (store (select .cse4 .cse2) .cse9 (select v_ArrVal_4249 .cse9)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse27 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4240))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse24 (store .cse27 .cse26 v_ArrVal_4243))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4241) .cse26 v_ArrVal_4242) .cse25 v_ArrVal_4244)) (.cse23 (store .cse24 .cse25 v_ArrVal_4245))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse21 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse23 .cse20 (store (select .cse23 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse18 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 0))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse22 (+ 40 v_prenex_40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse15 (store .cse16 .cse17 v_prenex_42))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse18 .cse17 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (not (= (store (select (store .cse19 .cse20 (store v_ArrVal_4244 .cse21 0)) .cse17) .cse22 (select v_prenex_41 .cse22)) v_prenex_41)) (< v_prenex_40 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_prenex_42 (store (select .cse16 .cse17) .cse22 (select v_prenex_42 .cse22)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse41 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4240))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4243))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse37 (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4241) .cse40 v_ArrVal_4242) .cse39 v_ArrVal_4244)) (.cse29 (store .cse38 .cse39 v_ArrVal_4245))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse31 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse36 (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse32 (+ 40 v_prenex_40)) (.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse33 (store .cse37 .cse30 (store (select .cse37 .cse30) .cse31 0)))) (or (not (= v_prenex_42 (store (let ((.cse28 (store .cse29 .cse30 (store v_ArrVal_4245 .cse31 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse32 (select v_prenex_42 .cse32)))) (not (= (store (select .cse33 .cse34) .cse32 (select v_prenex_41 .cse32)) v_prenex_41)) (< (let ((.cse35 (store .cse33 .cse34 v_prenex_41))) (select (select .cse35 (select (select (store .cse36 .cse34 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (< v_prenex_40 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-28 04:02:33,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4240))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4241) .cse14 v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse7 (store .cse11 .cse12 v_ArrVal_4245))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse0 (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 0))) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse3 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse0 .cse2) .cse3 (select v_prenex_41 .cse3)) v_prenex_41)) (< (let ((.cse4 (store .cse0 .cse2 v_prenex_41))) (select (select .cse4 (select (select (store .cse5 .cse2 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= (store (let ((.cse6 (store .cse7 .cse8 (store v_ArrVal_4245 .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse3 (select v_prenex_42 .cse3)) v_prenex_42)))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4240))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse29 .cse28 v_ArrVal_4243))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4241) .cse28 v_ArrVal_4242) .cse27 v_ArrVal_4244)) (.cse20 (store .cse26 .cse27 v_ArrVal_4245))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse16 (store .cse25 .cse21 (store (select .cse25 .cse21) .cse22 0))) (.cse17 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select .cse16 .cse17) .cse18 (select v_ArrVal_4249 .cse18)) v_ArrVal_4249)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse19 (store .cse20 .cse21 (store v_ArrVal_4245 .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_ArrVal_4250 .cse18)) v_ArrVal_4250)) (< 0 (+ (let ((.cse23 (store .cse16 .cse17 v_ArrVal_4249))) (select (select .cse23 (select (select (store .cse24 .cse17 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse42 (store |c_#memory_$Pointer$#2.base| .cse13 v_ArrVal_4240))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4243))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store (store (store |c_#memory_$Pointer$#2.offset| .cse13 v_ArrVal_4241) .cse41 v_ArrVal_4242) .cse40 v_ArrVal_4244)) (.cse38 (store .cse39 .cse40 v_ArrVal_4245))) (let ((.cse32 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse36 (store .cse38 .cse32 (store (select .cse38 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse35 (+ 40 v_prenex_40)) (.cse30 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 0))) (.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< v_prenex_40 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select (store .cse31 .cse32 (store v_ArrVal_4244 .cse33 0)) .cse34) .cse35 (select v_prenex_41 .cse35)) v_prenex_41)) (not (= v_prenex_42 (store (select .cse36 .cse34) .cse35 (select v_prenex_42 .cse35)))) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse37 (store .cse36 .cse34 v_prenex_42))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse30 .cse34 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-28 04:02:36,289 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4238))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_4240))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_4243))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4239) .cse12 v_ArrVal_4241) .cse13 v_ArrVal_4242) .cse11 v_ArrVal_4244)) (.cse9 (store .cse10 .cse11 v_ArrVal_4245))) (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_15|)))) (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_40))) (or (< v_prenex_40 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse2 (store .cse3 .cse4 v_prenex_42))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select .cse3 .cse4) .cse5 (select v_prenex_42 .cse5)) v_prenex_42)) (not (= v_prenex_41 (store (select (store .cse6 .cse7 (store v_ArrVal_4244 .cse8 0)) .cse4) .cse5 (select v_prenex_41 .cse5)))))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4238))) (let ((.cse28 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store .cse31 .cse28 v_ArrVal_4240))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse30 .cse29 v_ArrVal_4243))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4239) .cse28 v_ArrVal_4241) .cse29 v_ArrVal_4242) .cse27 v_ArrVal_4244)) (.cse20 (store .cse26 .cse27 v_ArrVal_4245))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse18 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse16 (store .cse25 .cse21 (store (select .cse25 .cse21) .cse22 0))) (.cse17 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= (store (select .cse16 .cse17) .cse18 (select v_ArrVal_4249 .cse18)) v_ArrVal_4249)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4250 (store (let ((.cse19 (store .cse20 .cse21 (store v_ArrVal_4245 .cse22 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_ArrVal_4250 .cse18)))) (< 0 (+ (let ((.cse23 (store .cse16 .cse17 v_ArrVal_4249))) (select (select .cse23 (select (select (store .cse24 .cse17 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse47 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4238))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4240))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4243))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse41 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4239) .cse44 v_ArrVal_4241) .cse45 v_ArrVal_4242) .cse43 v_ArrVal_4244)) (.cse38 (store .cse42 .cse43 v_ArrVal_4245))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse35 (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 0))) (.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (+ 40 v_prenex_40))) (or (< (let ((.cse32 (store .cse35 .cse34 v_prenex_41))) (select (select .cse32 (select (select (store .cse33 .cse34 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< v_prenex_40 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse35 .cse34) .cse36 (select v_prenex_41 .cse36)) v_prenex_41)) (not (= (store (let ((.cse37 (store .cse38 .cse39 (store v_ArrVal_4245 .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse36 (select v_prenex_42 .cse36)) v_prenex_42)))))))))))))))) is different from false [2024-11-28 04:02:37,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4238))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4240))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse10 (store .cse15 .cse14 v_ArrVal_4243))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4239) .cse13 v_ArrVal_4241) .cse14 v_ArrVal_4242) .cse11 v_ArrVal_4244)) (.cse9 (store .cse10 .cse11 v_ArrVal_4245))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse4 (+ 40 v_prenex_40)) (.cse8 (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0)))) (or (not (= (store (select (store .cse0 .cse1 (store v_ArrVal_4244 .cse2 0)) .cse3) .cse4 (select v_prenex_41 .cse4)) v_prenex_41)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse5 (store .cse7 .cse3 v_prenex_42))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (select (select (store .cse8 .cse3 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (not (= (store (select .cse7 .cse3) .cse4 (select v_prenex_42 .cse4)) v_prenex_42)) (< v_prenex_40 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_prenex_40 Int) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int)) (let ((.cse32 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4238))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4240))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4243))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse26 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4239) .cse29 v_ArrVal_4241) .cse30 v_ArrVal_4242) .cse28 v_ArrVal_4244)) (.cse22 (store .cse27 .cse28 v_ArrVal_4245))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse18 (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse25 (+ 40 v_prenex_40)) (.cse20 (store .cse26 .cse23 (store (select .cse26 .cse23) .cse24 0)))) (or (< (let ((.cse17 (store .cse20 .cse19 v_prenex_41))) (select (select .cse17 (select (select (store .cse18 .cse19 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1) (not (= (store (let ((.cse21 (store .cse22 .cse23 (store v_ArrVal_4245 .cse24 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse25 (select v_prenex_42 .cse25)) v_prenex_42)) (not (= (store (select .cse20 .cse19) .cse25 (select v_prenex_41 .cse25)) v_prenex_41)) (< v_prenex_40 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))))))) (forall ((v_ArrVal_4240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4239 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_4238))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4240))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4243))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse42 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_4239) .cse45 v_ArrVal_4241) .cse46 v_ArrVal_4242) .cse44 v_ArrVal_4244)) (.cse38 (store .cse43 .cse44 v_ArrVal_4245))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse40 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse34 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse41 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40)) (.cse36 (store .cse42 .cse39 (store (select .cse42 .cse39) .cse40 0)))) (or (< 0 (+ (let ((.cse33 (store .cse36 .cse35 v_ArrVal_4249))) (select (select .cse33 (select (select (store .cse34 .cse35 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) 1)) (not (= v_ArrVal_4250 (store (let ((.cse37 (store .cse38 .cse39 (store v_ArrVal_4245 .cse40 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) .cse41 (select v_ArrVal_4250 .cse41)))) (not (= v_ArrVal_4249 (store (select .cse36 .cse35) .cse41 (select v_ArrVal_4249 .cse41)))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))))))))))) is different from false [2024-11-28 04:02:39,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_13| Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4250 (Array Int Int)) (v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4256))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4238))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4240))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4243))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4255) .cse13 v_ArrVal_4239) .cse14 v_ArrVal_4241) .cse15 v_ArrVal_4242) .cse12 v_ArrVal_4244)) (.cse7 (store .cse11 .cse12 v_ArrVal_4245))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse4 (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 0))) (.cse5 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_13| 40))) (or (< 0 (+ (let ((.cse0 (store .cse4 .cse2 v_ArrVal_4249))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1)) (not (= v_ArrVal_4249 (store (select .cse4 .cse2) .cse5 (select v_ArrVal_4249 .cse5)))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4250 (store (let ((.cse6 (store .cse7 .cse8 (store v_ArrVal_4245 .cse9 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_ArrVal_4250 .cse5)))))))))))))))))) (forall ((v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4256))) (let ((.cse30 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse34 (store .cse35 .cse30 v_ArrVal_4238))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse33 (store .cse34 .cse31 v_ArrVal_4240))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse28 (store .cse33 .cse32 v_ArrVal_4243))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse24 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4255) .cse30 v_ArrVal_4239) .cse31 v_ArrVal_4241) .cse32 v_ArrVal_4242) .cse29 v_ArrVal_4244)) (.cse27 (store .cse28 .cse29 v_ArrVal_4245))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse22 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse23 (+ 40 v_prenex_40))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_15| (select (let ((.cse19 (store .cse20 .cse21 v_prenex_42))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse22 .cse21 v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< v_prenex_40 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_prenex_42 (store (select .cse20 .cse21) .cse23 (select v_prenex_42 .cse23)))) (not (= (store (select (store .cse24 .cse25 (store v_ArrVal_4244 .cse26 0)) .cse21) .cse23 (select v_prenex_41 .cse23)) v_prenex_41)))))))))))))))) (forall ((v_prenex_40 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_15| Int) (v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (v_ArrVal_4242 (Array Int Int)) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4255 (Array Int Int)) (v_ArrVal_4244 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4245 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_4238 (Array Int Int)) (v_ArrVal_4239 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4256))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4238))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4240))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4243))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse45 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4255) .cse48 v_ArrVal_4239) .cse49 v_ArrVal_4241) .cse50 v_ArrVal_4242) .cse47 v_ArrVal_4244)) (.cse42 (store .cse46 .cse47 v_ArrVal_4245))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse44 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse38 (store .cse42 .cse43 (store (select .cse42 .cse43) .cse44 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (let ((.cse36 (store .cse45 .cse43 (store (select .cse45 .cse43) .cse44 0))) (.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse40 (+ 40 v_prenex_40))) (or (< v_prenex_40 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (< (let ((.cse37 (store .cse36 .cse39 v_prenex_41))) (select (select .cse37 (select (select (store .cse38 .cse39 v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) 1) (not (= v_prenex_41 (store (select .cse36 .cse39) .cse40 (select v_prenex_41 .cse40)))) (not (= (store (let ((.cse41 (store .cse42 .cse43 (store v_ArrVal_4245 .cse44 |v_ULTIMATE.start_main_#t~malloc61#1.base_15|)))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse40 (select v_prenex_42 .cse40)) v_prenex_42)))))))))))))))))) is different from false [2024-11-28 04:02:40,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299114453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:02:40,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:02:40,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2024-11-28 04:02:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225242065] [2024-11-28 04:02:40,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:02:40,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 04:02:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:40,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 04:02:40,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1200, Unknown=14, NotChecked=1066, Total=2450 [2024-11-28 04:02:40,092 INFO L87 Difference]: Start difference. First operand 1406 states and 1753 transitions. Second operand has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:03:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:03:26,358 INFO L93 Difference]: Finished difference Result 1430 states and 1787 transitions. [2024-11-28 04:03:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 04:03:26,359 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-28 04:03:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:03:26,360 INFO L225 Difference]: With dead ends: 1430 [2024-11-28 04:03:26,360 INFO L226 Difference]: Without dead ends: 1430 [2024-11-28 04:03:26,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=307, Invalid=2281, Unknown=14, NotChecked=1430, Total=4032 [2024-11-28 04:03:26,362 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 745 mSDsluCounter, 7964 mSDsCounter, 0 mSdLazyCounter, 5875 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 8458 SdHoareTripleChecker+Invalid, 5897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:03:26,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 8458 Invalid, 5897 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5875 Invalid, 0 Unknown, 0 Unchecked, 42.5s Time] [2024-11-28 04:03:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-28 04:03:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1350. [2024-11-28 04:03:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1121 states have (on average 1.5004460303300624) internal successors, (1682), 1342 states have internal predecessors, (1682), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:03:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1692 transitions. [2024-11-28 04:03:26,373 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1692 transitions. Word has length 118 [2024-11-28 04:03:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:03:26,373 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1692 transitions. [2024-11-28 04:03:26,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 33 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:03:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1692 transitions. [2024-11-28 04:03:26,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-28 04:03:26,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:03:26,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:03:26,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 04:03:26,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:03:26,575 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 04:03:26,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash 686956707, now seen corresponding path program 1 times [2024-11-28 04:03:26,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:26,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844740269] [2024-11-28 04:03:26,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 04:03:26,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:26,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844740269] [2024-11-28 04:03:26,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844740269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:03:26,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:03:26,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:03:26,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226248063] [2024-11-28 04:03:26,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:03:26,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:03:26,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:26,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:03:26,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:03:26,748 INFO L87 Difference]: Start difference. First operand 1350 states and 1692 transitions. Second operand has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:03:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:03:30,412 INFO L93 Difference]: Finished difference Result 1650 states and 2071 transitions. [2024-11-28 04:03:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:03:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 127 [2024-11-28 04:03:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:03:30,414 INFO L225 Difference]: With dead ends: 1650 [2024-11-28 04:03:30,414 INFO L226 Difference]: Without dead ends: 1650 [2024-11-28 04:03:30,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:03:30,415 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 1494 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:03:30,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 911 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-28 04:03:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2024-11-28 04:03:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1534. [2024-11-28 04:03:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1316 states have (on average 1.4620060790273557) internal successors, (1924), 1526 states have internal predecessors, (1924), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:03:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 1934 transitions. [2024-11-28 04:03:30,435 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 1934 transitions. Word has length 127 [2024-11-28 04:03:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:03:30,435 INFO L471 AbstractCegarLoop]: Abstraction has 1534 states and 1934 transitions. [2024-11-28 04:03:30,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:03:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 1934 transitions. [2024-11-28 04:03:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-28 04:03:30,437 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:03:30,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:03:30,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-28 04:03:30,437 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 04:03:30,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:30,438 INFO L85 PathProgramCache]: Analyzing trace with hash 686956708, now seen corresponding path program 1 times [2024-11-28 04:03:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:30,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825677061] [2024-11-28 04:03:30,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 04:03:30,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:30,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825677061] [2024-11-28 04:03:30,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825677061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:03:30,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:03:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:03:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725556427] [2024-11-28 04:03:30,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:03:30,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:03:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:30,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:03:30,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:03:30,842 INFO L87 Difference]: Start difference. First operand 1534 states and 1934 transitions. Second operand has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:03:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:03:36,013 INFO L93 Difference]: Finished difference Result 2008 states and 2501 transitions. [2024-11-28 04:03:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:03:36,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 127 [2024-11-28 04:03:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:03:36,016 INFO L225 Difference]: With dead ends: 2008 [2024-11-28 04:03:36,016 INFO L226 Difference]: Without dead ends: 2008 [2024-11-28 04:03:36,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:03:36,017 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 2460 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:03:36,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 1052 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-28 04:03:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2024-11-28 04:03:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1819. [2024-11-28 04:03:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1623 states have (on average 1.4460874922982132) internal successors, (2347), 1811 states have internal predecessors, (2347), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-28 04:03:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2357 transitions. [2024-11-28 04:03:36,037 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2357 transitions. Word has length 127 [2024-11-28 04:03:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:03:36,038 INFO L471 AbstractCegarLoop]: Abstraction has 1819 states and 2357 transitions. [2024-11-28 04:03:36,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:03:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2357 transitions. [2024-11-28 04:03:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-28 04:03:36,039 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:03:36,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:03:36,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-28 04:03:36,039 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 04:03:36,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash -179177775, now seen corresponding path program 1 times [2024-11-28 04:03:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:36,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832605202] [2024-11-28 04:03:36,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:03:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832605202] [2024-11-28 04:03:36,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832605202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:03:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019279673] [2024-11-28 04:03:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:36,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:03:36,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:03:36,335 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:03:36,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:03:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:36,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 04:03:36,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:03:36,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:03:37,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:03:37,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:03:38,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:03:38,697 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:03:38,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 04:03:38,997 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:03:38,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 04:03:39,314 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:03:39,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 04:03:39,651 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:03:39,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 04:03:40,066 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:03:40,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:03:40,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:03:40,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-28 04:03:40,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:03:41,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:03:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:03:42,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:03:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019279673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:03:42,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:03:42,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4] total 18 [2024-11-28 04:03:42,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052660831] [2024-11-28 04:03:42,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:03:42,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 04:03:42,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:42,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 04:03:42,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-28 04:03:42,079 INFO L87 Difference]: Start difference. First operand 1819 states and 2357 transitions. Second operand has 16 states, 15 states have (on average 8.266666666666667) internal successors, (124), 16 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:04:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:04:04,431 INFO L93 Difference]: Finished difference Result 1894 states and 2441 transitions. [2024-11-28 04:04:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:04:04,432 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.266666666666667) internal successors, (124), 16 states have internal predecessors, (124), 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 128 [2024-11-28 04:04:04,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:04:04,433 INFO L225 Difference]: With dead ends: 1894 [2024-11-28 04:04:04,434 INFO L226 Difference]: Without dead ends: 1894 [2024-11-28 04:04:04,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2024-11-28 04:04:04,435 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 707 mSDsluCounter, 4381 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 4873 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:04:04,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 4873 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 20.5s Time] [2024-11-28 04:04:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2024-11-28 04:04:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1888. [2024-11-28 04:04:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1689 states have (on average 1.4292480757844879) internal successors, (2414), 1876 states have internal predecessors, (2414), 7 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-28 04:04:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2435 transitions. [2024-11-28 04:04:04,456 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2435 transitions. Word has length 128 [2024-11-28 04:04:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:04:04,456 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2435 transitions. [2024-11-28 04:04:04,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.266666666666667) internal successors, (124), 16 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:04:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2435 transitions. [2024-11-28 04:04:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-28 04:04:04,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:04:04,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:04:04,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 04:04:04,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2024-11-28 04:04:04,658 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 04:04:04,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:04:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash -179177774, now seen corresponding path program 1 times [2024-11-28 04:04:04,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:04:04,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543599780] [2024-11-28 04:04:04,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:04:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:04:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:04:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:04:05,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:04:05,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543599780] [2024-11-28 04:04:05,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543599780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:04:05,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265848536] [2024-11-28 04:04:05,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:04:05,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:04:05,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:04:05,042 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:04:05,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 04:04:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:04:05,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-28 04:04:05,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:04:05,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:04:07,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:04:08,068 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:04:08,068 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-28 04:04:08,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:04:08,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:04:09,052 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-28 04:04:09,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:04:10,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:04:10,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 50 [2024-11-28 04:04:10,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:04:11,159 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:04:11,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:04:11,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:04:11,857 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:04:11,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:04:11,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:04:12,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:04:12,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-28 04:04:12,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:04:13,353 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 04:04:13,353 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-28 04:04:13,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 04:04:13,691 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:04:13,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:04:13,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:04:14,381 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:04:14,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:04:14,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:04:14,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:04:14,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:04:16,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:04:16,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:04:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:04:16,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:04:18,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4871 (Array Int Int))) (<= 0 (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:04:18,541 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4871 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:04:18,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4870) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4869))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 16 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4870) .cse1 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 04:04:38,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0))) (forall ((v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4867 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4862))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_4864))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_4866))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4863) .cse0 v_ArrVal_4865) .cse1 v_ArrVal_4867) .cse2 v_ArrVal_4870) (select (select (store .cse3 .cse2 v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_4871))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 12)))) (forall ((v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4867 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0)) (forall ((v_ArrVal_4868 Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4862))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_4864))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_4866))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4869))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4863) .cse7 v_ArrVal_4865) .cse8 v_ArrVal_4867) .cse9 v_ArrVal_4870) .cse10 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 16) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_17| v_ArrVal_4868) (select (select (store .cse11 .cse10 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-28 04:05:27,728 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse11 (select |c_#memory_$Pointer$#2.base| .cse1))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_33| Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4861 Int) (v_ArrVal_4867 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_33| .cse0) (< 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse1 (store .cse11 (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_33|) v_ArrVal_4861)))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_4862))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_4864))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_4866))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4860) .cse2 v_ArrVal_4863) .cse3 v_ArrVal_4865) .cse4 v_ArrVal_4867) .cse5 v_ArrVal_4870) (select (select (store .cse6 .cse5 v_ArrVal_4869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_4871))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) 13))))) (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_33| .cse0) (forall ((v_ArrVal_4860 (Array Int Int)) (v_ArrVal_4862 (Array Int Int)) (v_ArrVal_4863 (Array Int Int)) (v_ArrVal_4864 (Array Int Int)) (v_ArrVal_4865 (Array Int Int)) (v_ArrVal_4866 (Array Int Int)) (v_ArrVal_4861 Int) (v_ArrVal_4867 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|) 0)) (forall ((v_ArrVal_4868 Int) (v_ArrVal_4870 (Array Int Int)) (v_ArrVal_4871 (Array Int Int)) (v_ArrVal_4872 (Array Int Int)) (v_ArrVal_4869 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#2.base| .cse1 (store .cse11 (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_33|) v_ArrVal_4861)))) (let ((.cse12 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse20 (store .cse21 .cse12 v_ArrVal_4862))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_4864))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_4866))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_4869))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (<= (+ 16 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4860) .cse12 v_ArrVal_4863) .cse13 v_ArrVal_4865) .cse14 v_ArrVal_4867) .cse15 v_ArrVal_4870) .cse16 v_ArrVal_4871) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_17| v_ArrVal_4868) (select (select (store .cse17 .cse16 v_ArrVal_4872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)))))))))))))))))))))) is different from false [2024-11-28 04:05:29,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265848536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:05:29,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:05:29,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 16] total 19 [2024-11-28 04:05:29,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376630701] [2024-11-28 04:05:29,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:05:29,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:05:29,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:05:29,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:05:29,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=756, Unknown=61, NotChecked=310, Total=1260 [2024-11-28 04:05:29,395 INFO L87 Difference]: Start difference. First operand 1888 states and 2435 transitions. Second operand has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:06:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:06:10,745 INFO L93 Difference]: Finished difference Result 2108 states and 2714 transitions. [2024-11-28 04:06:10,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:06:10,745 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 128 [2024-11-28 04:06:10,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:06:10,749 INFO L225 Difference]: With dead ends: 2108 [2024-11-28 04:06:10,749 INFO L226 Difference]: Without dead ends: 2106 [2024-11-28 04:06:10,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 71.5s TimeCoverageRelationStatistics Valid=145, Invalid=870, Unknown=61, NotChecked=330, Total=1406 [2024-11-28 04:06:10,750 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 589 mSDsluCounter, 5144 mSDsCounter, 0 mSdLazyCounter, 4599 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 5688 SdHoareTripleChecker+Invalid, 4603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:06:10,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 5688 Invalid, 4603 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4 Valid, 4599 Invalid, 0 Unknown, 0 Unchecked, 40.5s Time] [2024-11-28 04:06:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2024-11-28 04:06:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1822. [2024-11-28 04:06:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1626 states have (on average 1.4440344403444034) internal successors, (2348), 1814 states have internal predecessors, (2348), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-28 04:06:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2359 transitions. [2024-11-28 04:06:10,777 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2359 transitions. Word has length 128 [2024-11-28 04:06:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:06:10,778 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2359 transitions. [2024-11-28 04:06:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:06:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2359 transitions. [2024-11-28 04:06:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-28 04:06:10,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:06:10,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:06:10,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 04:06:10,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2024-11-28 04:06:10,980 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 04:06:10,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:06:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1407225235, now seen corresponding path program 1 times [2024-11-28 04:06:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:06:10,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441641529] [2024-11-28 04:06:10,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:06:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:06:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:06:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:06:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:06:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441641529] [2024-11-28 04:06:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441641529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:06:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149401128] [2024-11-28 04:06:11,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:06:11,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:06:11,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:06:11,636 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:06:11,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 04:06:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:06:12,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-28 04:06:12,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:06:12,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:06:12,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:06:14,825 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:06:14,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:06:14,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 04:06:15,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:06:15,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:06:15,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-28 04:06:15,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:06:16,789 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:06:16,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:06:16,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:06:17,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:06:17,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:06:17,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:06:18,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:06:18,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:06:18,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:06:18,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:06:18,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:06:18,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:06:19,351 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:06:19,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:06:19,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:06:19,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:06:19,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 04:06:20,044 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:06:20,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:06:20,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:06:20,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:06:20,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:06:21,309 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:06:21,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:06:21,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:06:22,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-11-28 04:06:22,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:06:24,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:06:24,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-28 04:06:24,894 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-28 04:06:24,895 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 3 case distinctions, treesize of input 16 treesize of output 26 [2024-11-28 04:06:25,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:06:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:06:26,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:06:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149401128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:06:28,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:06:28,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 24] total 28 [2024-11-28 04:06:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127361710] [2024-11-28 04:06:28,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:06:28,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-28 04:06:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:06:28,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-28 04:06:28,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2024-11-28 04:06:28,084 INFO L87 Difference]: Start difference. First operand 1822 states and 2359 transitions. Second operand has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 27 states have internal predecessors, (245), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:07:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:07:29,650 INFO L93 Difference]: Finished difference Result 2135 states and 2745 transitions. [2024-11-28 04:07:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 04:07:29,650 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 27 states have internal predecessors, (245), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 130 [2024-11-28 04:07:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:07:29,653 INFO L225 Difference]: With dead ends: 2135 [2024-11-28 04:07:29,653 INFO L226 Difference]: Without dead ends: 2131 [2024-11-28 04:07:29,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=307, Invalid=2345, Unknown=0, NotChecked=0, Total=2652 [2024-11-28 04:07:29,654 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 634 mSDsluCounter, 6072 mSDsCounter, 0 mSdLazyCounter, 6206 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 6519 SdHoareTripleChecker+Invalid, 6240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:07:29,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 6519 Invalid, 6240 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 6206 Invalid, 0 Unknown, 0 Unchecked, 55.7s Time] [2024-11-28 04:07:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2024-11-28 04:07:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1841. [2024-11-28 04:07:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1644 states have (on average 1.4409975669099757) internal successors, (2369), 1830 states have internal predecessors, (2369), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-28 04:07:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2382 transitions. [2024-11-28 04:07:29,679 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2382 transitions. Word has length 130 [2024-11-28 04:07:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:07:29,680 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2382 transitions. [2024-11-28 04:07:29,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 9.423076923076923) internal successors, (245), 27 states have internal predecessors, (245), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:07:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2382 transitions. [2024-11-28 04:07:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-28 04:07:29,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:07:29,681 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:07:29,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 04:07:29,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:07:29,882 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-28 04:07:29,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:07:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1138591865, now seen corresponding path program 1 times [2024-11-28 04:07:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:07:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953823840] [2024-11-28 04:07:29,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:07:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:07:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:07:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 04:07:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:07:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953823840] [2024-11-28 04:07:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953823840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:07:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525656584] [2024-11-28 04:07:30,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:07:30,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:07:30,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:07:30,918 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:07:30,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ed9ea5b-632e-4761-ba22-57cea5677045/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 04:07:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:07:31,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-28 04:07:31,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:07:31,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:07:32,855 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:07:32,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:07:33,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:07:33,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:07:33,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-28 04:07:33,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:07:34,712 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:07:34,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:07:34,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-28 04:07:35,395 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:07:35,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:07:35,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:07:35,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:07:35,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:07:35,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:07:36,526 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:07:36,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:07:36,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:07:37,119 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:07:37,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 04:07:37,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:07:37,798 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:07:37,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:07:38,235 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-28 04:07:38,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 62 [2024-11-28 04:07:38,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 31 [2024-11-28 04:07:39,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:07:39,238 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-28 04:07:39,238 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 101 treesize of output 64 [2024-11-28 04:07:39,275 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 69 treesize of output 48 [2024-11-28 04:07:41,437 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-28 04:07:41,438 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 50 treesize of output 25 [2024-11-28 04:07:41,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:07:42,716 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-28 04:07:42,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 109 [2024-11-28 04:07:42,849 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:07:42,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 89 [2024-11-28 04:07:42,890 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 30 treesize of output 14 [2024-11-28 04:07:44,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-28 04:07:44,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-28 04:07:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:07:44,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:07:46,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5375 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem67#1.base| v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_5376 (Array Int Int)) (v_ArrVal_5375 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem67#1.base| v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem67#1.base| v_ArrVal_5376) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:07:46,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525656584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:07:46,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:07:46,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24] total 29 [2024-11-28 04:07:46,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319717171] [2024-11-28 04:07:46,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:07:46,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 04:07:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:07:46,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 04:07:46,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=897, Unknown=1, NotChecked=60, Total=1056 [2024-11-28 04:07:46,320 INFO L87 Difference]: Start difference. First operand 1841 states and 2382 transitions. Second operand has 29 states, 27 states have (on average 9.148148148148149) internal successors, (247), 29 states have internal predecessors, (247), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4)