./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.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_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/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_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/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_281222bf-d8d7-489c-a7e8-9919d12d8b9b/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 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:24:23,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:24:23,261 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:24:23,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:24:23,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:24:23,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:24:23,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:24:23,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:24:23,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:24:23,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:24:23,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:24:23,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:24:23,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:24:23,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:24:23,336 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:24:23,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:24:23,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:24:23,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:24:23,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:24:23,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:24:23,337 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:24:23,337 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:24:23,337 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:24:23,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:24:23,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:24:23,338 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:24:23,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:24:23,338 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:24:23,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:24:23,338 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:24:23,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:24:23,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:24:23,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:24:23,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:24:23,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:24:23,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:24:23,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:24:23,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:24:23,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:24:23,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:24:23,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:24:23,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:24:23,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:24:23,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:24:23,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:24:23,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:24:23,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:24:23,343 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_281222bf-d8d7-489c-a7e8-9919d12d8b9b/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 -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2024-11-28 05:24:23,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:24:23,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:24:23,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:24:23,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:24:23,809 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:24:23,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2024-11-28 05:24:27,670 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/data/92c99232a/72afcf4111ce4d34987c98989b24616e/FLAG47d1c705f [2024-11-28 05:24:28,040 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:24:28,041 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2024-11-28 05:24:28,058 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/data/92c99232a/72afcf4111ce4d34987c98989b24616e/FLAG47d1c705f [2024-11-28 05:24:28,078 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/data/92c99232a/72afcf4111ce4d34987c98989b24616e [2024-11-28 05:24:28,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:24:28,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:24:28,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:24:28,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:24:28,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:24:28,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc3d9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28, skipping insertion in model container [2024-11-28 05:24:28,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:24:28,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:24:28,560 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:24:28,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:24:28,711 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:24:28,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28 WrapperNode [2024-11-28 05:24:28,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:24:28,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:24:28,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:24:28,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:24:28,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,790 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-11-28 05:24:28,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:24:28,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:24:28,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:24:28,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:24:28,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,851 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 13, 16]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 3, 8]. [2024-11-28 05:24:28,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:24:28,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:24:28,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:24:28,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:24:28,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (1/1) ... [2024-11-28 05:24:28,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:24:28,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:24:28,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:24:28,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:24:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:24:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:24:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:24:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:24:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 05:24:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:24:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:24:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 05:24:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:24:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:24:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:24:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 05:24:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:24:28,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:24:29,178 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:24:29,181 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:24:29,785 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-11-28 05:24:29,786 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:24:29,802 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:24:29,803 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 05:24:29,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:29 BoogieIcfgContainer [2024-11-28 05:24:29,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:24:29,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:24:29,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:24:29,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:24:29,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:28" (1/3) ... [2024-11-28 05:24:29,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:29, skipping insertion in model container [2024-11-28 05:24:29,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:28" (2/3) ... [2024-11-28 05:24:29,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:29, skipping insertion in model container [2024-11-28 05:24:29,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:29" (3/3) ... [2024-11-28 05:24:29,818 INFO L128 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2024-11-28 05:24:29,838 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:24:29,840 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG skiplist_2lvl.i that has 1 procedures, 134 locations, 1 initial locations, 4 loop locations, and 65 error locations. [2024-11-28 05:24:29,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:24:29,950 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;@74030fba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:24:29,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-28 05:24:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 133 states have internal predecessors, (144), 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 05:24:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 05:24:29,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:29,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 05:24:29,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-28 05:24:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004148814] [2024-11-28 05:24:29,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:30,317 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 05:24:30,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:30,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004148814] [2024-11-28 05:24:30,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004148814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:30,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:30,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:24:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182537963] [2024-11-28 05:24:30,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:30,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:24:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:30,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:24:30,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:24:30,363 INFO L87 Difference]: Start difference. First operand has 134 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 133 states have internal predecessors, (144), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:30,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:30,628 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2024-11-28 05:24:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:24:30,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 05:24:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:30,645 INFO L225 Difference]: With dead ends: 127 [2024-11-28 05:24:30,645 INFO L226 Difference]: Without dead ends: 125 [2024-11-28 05:24:30,648 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 05:24:30,654 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:30,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 166 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:24:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-28 05:24:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-28 05:24:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.955223880597015) internal successors, (131), 124 states have internal predecessors, (131), 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 05:24:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2024-11-28 05:24:30,715 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 3 [2024-11-28 05:24:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:30,716 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2024-11-28 05:24:30,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2024-11-28 05:24:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 05:24:30,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:30,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 05:24:30,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:24:30,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:30,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-28 05:24:30,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:30,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785078841] [2024-11-28 05:24:30,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:30,892 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 05:24:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785078841] [2024-11-28 05:24:30,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785078841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:30,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:30,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:24:30,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436690629] [2024-11-28 05:24:30,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:30,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:24:30,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:30,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:24:30,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:24:30,895 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:31,109 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2024-11-28 05:24:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:24:31,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 05:24:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:31,113 INFO L225 Difference]: With dead ends: 118 [2024-11-28 05:24:31,113 INFO L226 Difference]: Without dead ends: 118 [2024-11-28 05:24:31,113 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 05:24:31,115 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 21 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:31,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 168 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:24:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-28 05:24:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-28 05:24:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 117 states have internal predecessors, (124), 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 05:24:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2024-11-28 05:24:31,135 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 3 [2024-11-28 05:24:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:31,135 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2024-11-28 05:24:31,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2024-11-28 05:24:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:24:31,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:31,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:31,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:24:31,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:31,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606480, now seen corresponding path program 1 times [2024-11-28 05:24:31,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:31,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846995976] [2024-11-28 05:24:31,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:31,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:31,696 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 05:24:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846995976] [2024-11-28 05:24:31,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846995976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:31,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:31,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:24:31,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794096255] [2024-11-28 05:24:31,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:31,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:24:31,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:31,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:24:31,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:24:31,699 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 05:24:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:32,023 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2024-11-28 05:24:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:24:32,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 05:24:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:32,024 INFO L225 Difference]: With dead ends: 117 [2024-11-28 05:24:32,024 INFO L226 Difference]: Without dead ends: 117 [2024-11-28 05:24:32,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 05:24:32,026 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 16 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:32,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 283 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:24:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-28 05:24:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-28 05:24:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 67 states have (on average 1.835820895522388) internal successors, (123), 116 states have internal predecessors, (123), 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 05:24:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2024-11-28 05:24:32,048 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 10 [2024-11-28 05:24:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:32,048 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2024-11-28 05:24:32,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 05:24:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2024-11-28 05:24:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:24:32,049 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:32,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:32,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:24:32,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606481, now seen corresponding path program 1 times [2024-11-28 05:24:32,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:32,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894979272] [2024-11-28 05:24:32,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:32,633 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 05:24:32,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:32,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894979272] [2024-11-28 05:24:32,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894979272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:32,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:32,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:24:32,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120965997] [2024-11-28 05:24:32,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:32,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:24:32,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:32,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:24:32,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:24:32,636 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 05:24:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:32,988 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2024-11-28 05:24:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:24:32,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 05:24:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:32,989 INFO L225 Difference]: With dead ends: 116 [2024-11-28 05:24:32,990 INFO L226 Difference]: Without dead ends: 116 [2024-11-28 05:24:32,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:24:32,991 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 32 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:32,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 266 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:24:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-28 05:24:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-28 05:24:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 115 states have internal predecessors, (122), 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 05:24:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2024-11-28 05:24:33,007 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 10 [2024-11-28 05:24:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:33,011 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2024-11-28 05:24:33,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 05:24:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2024-11-28 05:24:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 05:24:33,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:33,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:33,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:24:33,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:33,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2024-11-28 05:24:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:33,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384311290] [2024-11-28 05:24:33,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:33,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:24:33,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:33,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384311290] [2024-11-28 05:24:33,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384311290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:33,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:33,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:24:33,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144368638] [2024-11-28 05:24:33,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:33,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:24:33,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:33,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:24:33,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:24:33,147 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:33,329 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2024-11-28 05:24:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:24:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 05:24:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:33,332 INFO L225 Difference]: With dead ends: 115 [2024-11-28 05:24:33,332 INFO L226 Difference]: Without dead ends: 115 [2024-11-28 05:24:33,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:24:33,333 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:33,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 389 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:24:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-28 05:24:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-28 05:24:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 114 states have internal predecessors, (121), 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 05:24:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2024-11-28 05:24:33,354 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 11 [2024-11-28 05:24:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:33,354 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2024-11-28 05:24:33,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2024-11-28 05:24:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 05:24:33,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:33,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:33,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:24:33,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2024-11-28 05:24:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:33,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801244752] [2024-11-28 05:24:33,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:33,964 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 05:24:33,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:33,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801244752] [2024-11-28 05:24:33,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801244752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:33,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:33,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:24:33,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977673499] [2024-11-28 05:24:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:33,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:24:33,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:33,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:24:33,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:24:33,966 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:34,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:34,377 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2024-11-28 05:24:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:24:34,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 05:24:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:34,379 INFO L225 Difference]: With dead ends: 114 [2024-11-28 05:24:34,379 INFO L226 Difference]: Without dead ends: 114 [2024-11-28 05:24:34,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:24:34,380 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 32 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:34,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 266 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:24:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-28 05:24:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-28 05:24:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.791044776119403) internal successors, (120), 113 states have internal predecessors, (120), 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 05:24:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2024-11-28 05:24:34,396 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 11 [2024-11-28 05:24:34,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:34,396 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2024-11-28 05:24:34,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2024-11-28 05:24:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 05:24:34,397 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:34,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:34,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:24:34,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:34,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash -266592339, now seen corresponding path program 1 times [2024-11-28 05:24:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:34,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147873611] [2024-11-28 05:24:34,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:34,592 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 05:24:34,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:34,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147873611] [2024-11-28 05:24:34,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147873611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:34,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:34,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:24:34,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848043113] [2024-11-28 05:24:34,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:34,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:24:34,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:34,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:24:34,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:24:34,595 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 05:24:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:34,844 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2024-11-28 05:24:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:24:34,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2024-11-28 05:24:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:34,846 INFO L225 Difference]: With dead ends: 113 [2024-11-28 05:24:34,846 INFO L226 Difference]: Without dead ends: 113 [2024-11-28 05:24:34,846 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 05:24:34,847 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 6 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:34,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 279 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:24:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-28 05:24:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-28 05:24:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 112 states have internal predecessors, (119), 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 05:24:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2024-11-28 05:24:34,860 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 15 [2024-11-28 05:24:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:34,861 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2024-11-28 05:24:34,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 05:24:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2024-11-28 05:24:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 05:24:34,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:34,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:34,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:24:34,863 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:34,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash -266592338, now seen corresponding path program 1 times [2024-11-28 05:24:34,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:34,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657979483] [2024-11-28 05:24:34,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:34,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:35,181 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 05:24:35,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657979483] [2024-11-28 05:24:35,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657979483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:35,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:35,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:24:35,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845005682] [2024-11-28 05:24:35,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:35,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:24:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:35,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:24:35,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:24:35,183 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 05:24:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:35,445 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2024-11-28 05:24:35,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:24:35,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2024-11-28 05:24:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:35,447 INFO L225 Difference]: With dead ends: 112 [2024-11-28 05:24:35,448 INFO L226 Difference]: Without dead ends: 112 [2024-11-28 05:24:35,448 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 05:24:35,449 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 5 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:35,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 294 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:24:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-28 05:24:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-28 05:24:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 111 states have internal predecessors, (118), 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 05:24:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2024-11-28 05:24:35,460 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 15 [2024-11-28 05:24:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:35,464 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2024-11-28 05:24:35,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 05:24:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2024-11-28 05:24:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 05:24:35,465 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:35,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:35,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:24:35,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:35,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash 325572089, now seen corresponding path program 1 times [2024-11-28 05:24:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587806552] [2024-11-28 05:24:35,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:35,582 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 05:24:35,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:35,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587806552] [2024-11-28 05:24:35,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587806552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:35,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:35,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:24:35,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184755452] [2024-11-28 05:24:35,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:35,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:24:35,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:35,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:24:35,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:24:35,589 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:24:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:35,745 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2024-11-28 05:24:35,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:24:35,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:24:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:35,746 INFO L225 Difference]: With dead ends: 111 [2024-11-28 05:24:35,747 INFO L226 Difference]: Without dead ends: 111 [2024-11-28 05:24:35,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:24:35,748 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 2 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:35,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 378 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:24:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-28 05:24:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-28 05:24:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 67 states have (on average 1.7462686567164178) internal successors, (117), 110 states have internal predecessors, (117), 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 05:24:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2024-11-28 05:24:35,757 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 16 [2024-11-28 05:24:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:35,758 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2024-11-28 05:24:35,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 05:24:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2024-11-28 05:24:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 05:24:35,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:35,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:35,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:24:35,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:35,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:35,759 INFO L85 PathProgramCache]: Analyzing trace with hash 325572090, now seen corresponding path program 1 times [2024-11-28 05:24:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:35,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527527987] [2024-11-28 05:24:35,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:35,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:24:36,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:36,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527527987] [2024-11-28 05:24:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527527987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:36,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:24:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730312166] [2024-11-28 05:24:36,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:36,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:24:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:36,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:24:36,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:24:36,186 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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 05:24:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:36,521 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2024-11-28 05:24:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:24:36,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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 05:24:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:36,522 INFO L225 Difference]: With dead ends: 110 [2024-11-28 05:24:36,522 INFO L226 Difference]: Without dead ends: 110 [2024-11-28 05:24:36,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:24:36,524 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:36,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 354 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:24:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-28 05:24:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-28 05:24:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 109 states have internal predecessors, (116), 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 05:24:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2024-11-28 05:24:36,530 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 16 [2024-11-28 05:24:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:36,531 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2024-11-28 05:24:36,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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 05:24:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2024-11-28 05:24:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 05:24:36,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:36,532 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 05:24:36,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:24:36,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:36,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:36,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1117688001, now seen corresponding path program 1 times [2024-11-28 05:24:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124084095] [2024-11-28 05:24:36,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:36,707 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 05:24:36,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124084095] [2024-11-28 05:24:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124084095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:24:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013362827] [2024-11-28 05:24:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:36,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:24:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:36,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:24:36,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:24:36,710 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 05:24:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:36,986 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2024-11-28 05:24:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:24:36,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 05:24:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:36,988 INFO L225 Difference]: With dead ends: 108 [2024-11-28 05:24:36,988 INFO L226 Difference]: Without dead ends: 108 [2024-11-28 05:24:36,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 05:24:36,989 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 114 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:36,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 220 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:24:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-28 05:24:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-28 05:24:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 107 states have internal predecessors, (114), 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 05:24:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2024-11-28 05:24:36,994 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 22 [2024-11-28 05:24:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:36,994 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2024-11-28 05:24:36,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 05:24:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2024-11-28 05:24:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 05:24:36,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:36,995 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 05:24:36,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:24:36,995 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:36,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1117688000, now seen corresponding path program 1 times [2024-11-28 05:24:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:36,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562793809] [2024-11-28 05:24:36,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:36,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:37,287 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 05:24:37,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:37,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562793809] [2024-11-28 05:24:37,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562793809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:37,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:37,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:24:37,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440580075] [2024-11-28 05:24:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:37,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:24:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:37,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:24:37,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:24:37,290 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 05:24:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:37,558 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2024-11-28 05:24:37,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:24:37,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 05:24:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:37,560 INFO L225 Difference]: With dead ends: 106 [2024-11-28 05:24:37,560 INFO L226 Difference]: Without dead ends: 106 [2024-11-28 05:24:37,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:24:37,561 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 112 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:37,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 251 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:24:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-28 05:24:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-28 05:24:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 67 states have (on average 1.671641791044776) internal successors, (112), 105 states have internal predecessors, (112), 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 05:24:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2024-11-28 05:24:37,567 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 22 [2024-11-28 05:24:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:37,567 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2024-11-28 05:24:37,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 05:24:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2024-11-28 05:24:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 05:24:37,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:37,570 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 05:24:37,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:24:37,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:37,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1117683004, now seen corresponding path program 1 times [2024-11-28 05:24:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:37,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006729672] [2024-11-28 05:24:37,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:37,703 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 05:24:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006729672] [2024-11-28 05:24:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006729672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:37,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:37,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:24:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840592516] [2024-11-28 05:24:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:37,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:24:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:37,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:24:37,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:24:37,706 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 05:24:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:37,989 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2024-11-28 05:24:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:24:37,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 05:24:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:37,990 INFO L225 Difference]: With dead ends: 103 [2024-11-28 05:24:37,990 INFO L226 Difference]: Without dead ends: 103 [2024-11-28 05:24:37,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:24:37,991 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 77 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:37,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 196 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:24:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-28 05:24:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-28 05:24:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 102 states have internal predecessors, (110), 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 05:24:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2024-11-28 05:24:37,997 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 22 [2024-11-28 05:24:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:37,998 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2024-11-28 05:24:37,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 05:24:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2024-11-28 05:24:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 05:24:37,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:38,000 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 05:24:38,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:24:38,000 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:38,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1117683003, now seen corresponding path program 1 times [2024-11-28 05:24:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:38,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718437671] [2024-11-28 05:24:38,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:38,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:38,236 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 05:24:38,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:38,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718437671] [2024-11-28 05:24:38,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718437671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:38,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:38,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:24:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204636649] [2024-11-28 05:24:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:24:38,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:38,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:24:38,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:24:38,239 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 05:24:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:38,544 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-28 05:24:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:24:38,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 05:24:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:38,545 INFO L225 Difference]: With dead ends: 98 [2024-11-28 05:24:38,545 INFO L226 Difference]: Without dead ends: 98 [2024-11-28 05:24:38,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:24:38,546 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:38,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 262 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:24:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-28 05:24:38,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-28 05:24:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 97 states have internal predecessors, (104), 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 05:24:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2024-11-28 05:24:38,551 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 22 [2024-11-28 05:24:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:38,551 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2024-11-28 05:24:38,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 05:24:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2024-11-28 05:24:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 05:24:38,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:38,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:38,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:24:38,553 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:38,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:38,553 INFO L85 PathProgramCache]: Analyzing trace with hash -356344125, now seen corresponding path program 1 times [2024-11-28 05:24:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:38,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302390146] [2024-11-28 05:24:38,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:38,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:38,799 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 05:24:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:38,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302390146] [2024-11-28 05:24:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302390146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:38,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:38,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:24:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353665983] [2024-11-28 05:24:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:38,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:24:38,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:38,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:24:38,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:24:38,801 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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 05:24:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:39,227 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-28 05:24:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:24:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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 24 [2024-11-28 05:24:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:39,229 INFO L225 Difference]: With dead ends: 96 [2024-11-28 05:24:39,229 INFO L226 Difference]: Without dead ends: 96 [2024-11-28 05:24:39,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:24:39,230 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 147 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:39,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 285 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:24:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-28 05:24:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-28 05:24:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 94 states have internal predecessors, (102), 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 05:24:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-28 05:24:39,235 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 24 [2024-11-28 05:24:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:39,235 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-28 05:24:39,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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 05:24:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-28 05:24:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 05:24:39,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:39,236 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] [2024-11-28 05:24:39,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:24:39,237 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:39,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash -356344124, now seen corresponding path program 1 times [2024-11-28 05:24:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:39,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144439840] [2024-11-28 05:24:39,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:39,844 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 05:24:39,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:39,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144439840] [2024-11-28 05:24:39,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144439840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:39,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:39,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:24:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455127369] [2024-11-28 05:24:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:39,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 05:24:39,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:39,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 05:24:39,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:24:39,847 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 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 05:24:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:40,422 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2024-11-28 05:24:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:24:40,423 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 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 24 [2024-11-28 05:24:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:40,424 INFO L225 Difference]: With dead ends: 132 [2024-11-28 05:24:40,424 INFO L226 Difference]: Without dead ends: 132 [2024-11-28 05:24:40,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:24:40,425 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 228 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:40,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 349 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:24:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-28 05:24:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2024-11-28 05:24:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 118 states have internal predecessors, (142), 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 05:24:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2024-11-28 05:24:40,432 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 24 [2024-11-28 05:24:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:40,433 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2024-11-28 05:24:40,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 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 05:24:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2024-11-28 05:24:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 05:24:40,434 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:40,434 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] [2024-11-28 05:24:40,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:24:40,434 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:40,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1987202653, now seen corresponding path program 1 times [2024-11-28 05:24:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777775836] [2024-11-28 05:24:40,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:40,603 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 05:24:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:40,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777775836] [2024-11-28 05:24:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777775836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:40,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:40,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:24:40,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505712285] [2024-11-28 05:24:40,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:40,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:24:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:40,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:24:40,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:24:40,606 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 05:24:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:40,722 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2024-11-28 05:24:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:24:40,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2024-11-28 05:24:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:40,724 INFO L225 Difference]: With dead ends: 118 [2024-11-28 05:24:40,725 INFO L226 Difference]: Without dead ends: 118 [2024-11-28 05:24:40,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:24:40,725 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 70 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:40,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 299 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:24:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-28 05:24:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-28 05:24:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 117 states have internal predecessors, (141), 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 05:24:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2024-11-28 05:24:40,731 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 25 [2024-11-28 05:24:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:40,731 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-11-28 05:24:40,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 05:24:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2024-11-28 05:24:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 05:24:40,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:40,733 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] [2024-11-28 05:24:40,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 05:24:40,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:40,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1561275071, now seen corresponding path program 1 times [2024-11-28 05:24:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:40,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370257430] [2024-11-28 05:24:40,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:40,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:40,971 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 05:24:40,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:40,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370257430] [2024-11-28 05:24:40,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370257430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:40,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:40,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:24:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834648566] [2024-11-28 05:24:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:40,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:24:40,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:40,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:24:40,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:24:40,972 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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 05:24:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:41,305 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2024-11-28 05:24:41,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:24:41,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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 27 [2024-11-28 05:24:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:41,307 INFO L225 Difference]: With dead ends: 126 [2024-11-28 05:24:41,307 INFO L226 Difference]: Without dead ends: 126 [2024-11-28 05:24:41,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:24:41,308 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 57 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:41,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 304 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:24:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-28 05:24:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2024-11-28 05:24:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.510204081632653) internal successors, (148), 122 states have internal predecessors, (148), 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 05:24:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2024-11-28 05:24:41,314 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 27 [2024-11-28 05:24:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:41,314 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2024-11-28 05:24:41,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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 05:24:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2024-11-28 05:24:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 05:24:41,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:41,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] [2024-11-28 05:24:41,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 05:24:41,316 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:41,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1561275070, now seen corresponding path program 1 times [2024-11-28 05:24:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:41,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035897851] [2024-11-28 05:24:41,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:41,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:41,900 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 05:24:41,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:41,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035897851] [2024-11-28 05:24:41,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035897851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:41,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:41,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:24:41,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113625527] [2024-11-28 05:24:41,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:41,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:24:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:41,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:24:41,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:24:41,904 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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 05:24:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:42,322 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2024-11-28 05:24:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:24:42,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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 27 [2024-11-28 05:24:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:42,325 INFO L225 Difference]: With dead ends: 125 [2024-11-28 05:24:42,325 INFO L226 Difference]: Without dead ends: 125 [2024-11-28 05:24:42,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:24:42,326 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 59 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:42,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 307 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:24:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-28 05:24:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-28 05:24:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.5) internal successors, (147), 122 states have internal predecessors, (147), 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 05:24:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2024-11-28 05:24:42,333 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 27 [2024-11-28 05:24:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:42,336 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2024-11-28 05:24:42,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 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 05:24:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2024-11-28 05:24:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:24:42,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:42,338 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] [2024-11-28 05:24:42,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 05:24:42,338 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:42,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1074755007, now seen corresponding path program 1 times [2024-11-28 05:24:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:42,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059037370] [2024-11-28 05:24:42,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:42,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:42,612 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 05:24:42,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:42,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059037370] [2024-11-28 05:24:42,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059037370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:42,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:42,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:24:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104114408] [2024-11-28 05:24:42,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:42,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:24:42,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:42,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:24:42,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:24:42,615 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 05:24:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:42,756 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2024-11-28 05:24:42,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:24:42,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 28 [2024-11-28 05:24:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:42,758 INFO L225 Difference]: With dead ends: 124 [2024-11-28 05:24:42,758 INFO L226 Difference]: Without dead ends: 124 [2024-11-28 05:24:42,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:24:42,758 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 60 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:42,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 489 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:24:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-28 05:24:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-28 05:24:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.489795918367347) internal successors, (146), 122 states have internal predecessors, (146), 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 05:24:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2024-11-28 05:24:42,764 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 28 [2024-11-28 05:24:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:42,764 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2024-11-28 05:24:42,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 05:24:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2024-11-28 05:24:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 05:24:42,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:42,766 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] [2024-11-28 05:24:42,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 05:24:42,767 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:42,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:42,768 INFO L85 PathProgramCache]: Analyzing trace with hash -275714798, now seen corresponding path program 1 times [2024-11-28 05:24:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:42,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457251666] [2024-11-28 05:24:42,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:42,853 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 05:24:42,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:42,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457251666] [2024-11-28 05:24:42,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457251666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:42,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:42,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:24:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713096409] [2024-11-28 05:24:42,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:42,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:24:42,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:42,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:24:42,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:24:42,855 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 05:24:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:43,026 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2024-11-28 05:24:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:24:43,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-11-28 05:24:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:43,028 INFO L225 Difference]: With dead ends: 123 [2024-11-28 05:24:43,028 INFO L226 Difference]: Without dead ends: 123 [2024-11-28 05:24:43,028 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 05:24:43,028 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 46 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:43,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 124 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:24:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-28 05:24:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-28 05:24:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.44) internal successors, (144), 121 states have internal predecessors, (144), 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 05:24:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2024-11-28 05:24:43,034 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 30 [2024-11-28 05:24:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:43,035 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2024-11-28 05:24:43,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 05:24:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2024-11-28 05:24:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 05:24:43,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:43,036 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] [2024-11-28 05:24:43,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 05:24:43,036 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:43,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash -275714797, now seen corresponding path program 1 times [2024-11-28 05:24:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:43,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325068012] [2024-11-28 05:24:43,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:43,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:43,812 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 05:24:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325068012] [2024-11-28 05:24:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325068012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:43,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:43,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 05:24:43,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251996014] [2024-11-28 05:24:43,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:43,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:24:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:43,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:24:43,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:24:43,817 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 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 05:24:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:44,622 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2024-11-28 05:24:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:24:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 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 30 [2024-11-28 05:24:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:44,624 INFO L225 Difference]: With dead ends: 138 [2024-11-28 05:24:44,624 INFO L226 Difference]: Without dead ends: 138 [2024-11-28 05:24:44,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:24:44,626 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 219 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:44,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 540 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:24:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-28 05:24:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2024-11-28 05:24:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 126 states have internal predecessors, (150), 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 05:24:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2024-11-28 05:24:44,632 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 30 [2024-11-28 05:24:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:44,633 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2024-11-28 05:24:44,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 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 05:24:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2024-11-28 05:24:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 05:24:44,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:44,634 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] [2024-11-28 05:24:44,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 05:24:44,635 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1744651668, now seen corresponding path program 1 times [2024-11-28 05:24:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056027361] [2024-11-28 05:24:44,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:44,917 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 05:24:44,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056027361] [2024-11-28 05:24:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056027361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:44,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:44,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:24:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619325170] [2024-11-28 05:24:44,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:44,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:24:44,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:44,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:24:44,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:24:44,920 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 05:24:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:45,085 INFO L93 Difference]: Finished difference Result 130 states and 153 transitions. [2024-11-28 05:24:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:24:45,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2024-11-28 05:24:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:45,086 INFO L225 Difference]: With dead ends: 130 [2024-11-28 05:24:45,086 INFO L226 Difference]: Without dead ends: 130 [2024-11-28 05:24:45,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:24:45,087 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 55 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:45,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 541 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:24:45,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-28 05:24:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-28 05:24:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 129 states have internal predecessors, (153), 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 05:24:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2024-11-28 05:24:45,096 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 30 [2024-11-28 05:24:45,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:45,096 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2024-11-28 05:24:45,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 05:24:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2024-11-28 05:24:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 05:24:45,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:45,097 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] [2024-11-28 05:24:45,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 05:24:45,098 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:45,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash 42709327, now seen corresponding path program 1 times [2024-11-28 05:24:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:45,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92974510] [2024-11-28 05:24:45,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:24:46,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92974510] [2024-11-28 05:24:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92974510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:46,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:46,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-28 05:24:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338170713] [2024-11-28 05:24:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:46,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:24:46,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:46,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:24:46,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:24:46,929 INFO L87 Difference]: Start difference. First operand 130 states and 153 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:48,289 INFO L93 Difference]: Finished difference Result 164 states and 192 transitions. [2024-11-28 05:24:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 05:24:48,290 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-28 05:24:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:48,291 INFO L225 Difference]: With dead ends: 164 [2024-11-28 05:24:48,291 INFO L226 Difference]: Without dead ends: 164 [2024-11-28 05:24:48,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 05:24:48,292 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 89 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:48,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 935 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:24:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-28 05:24:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 140. [2024-11-28 05:24:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 139 states have internal predecessors, (164), 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 05:24:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2024-11-28 05:24:48,299 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 31 [2024-11-28 05:24:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:48,299 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2024-11-28 05:24:48,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2024-11-28 05:24:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 05:24:48,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:48,300 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] [2024-11-28 05:24:48,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 05:24:48,301 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:48,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1750373348, now seen corresponding path program 1 times [2024-11-28 05:24:48,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:48,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377330341] [2024-11-28 05:24:48,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:48,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:48,674 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 05:24:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:48,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377330341] [2024-11-28 05:24:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377330341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:48,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:48,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:24:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794644407] [2024-11-28 05:24:48,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:48,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:24:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:48,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:24:48,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:24:48,677 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:48,918 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2024-11-28 05:24:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:24:48,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-28 05:24:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:48,920 INFO L225 Difference]: With dead ends: 141 [2024-11-28 05:24:48,920 INFO L226 Difference]: Without dead ends: 141 [2024-11-28 05:24:48,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:24:48,921 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 56 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:48,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 490 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:24:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-28 05:24:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-28 05:24:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.3865546218487395) internal successors, (165), 140 states have internal predecessors, (165), 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 05:24:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2024-11-28 05:24:48,926 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 31 [2024-11-28 05:24:48,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:48,927 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2024-11-28 05:24:48,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2024-11-28 05:24:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:24:48,928 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:48,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:48,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 05:24:48,928 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:48,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1573000850, now seen corresponding path program 1 times [2024-11-28 05:24:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879206108] [2024-11-28 05:24:48,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:49,042 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 05:24:49,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:49,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879206108] [2024-11-28 05:24:49,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879206108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:49,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:49,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:24:49,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721717560] [2024-11-28 05:24:49,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:49,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:24:49,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:49,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:24:49,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:24:49,045 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:49,204 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2024-11-28 05:24:49,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:24:49,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 05:24:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:49,205 INFO L225 Difference]: With dead ends: 140 [2024-11-28 05:24:49,205 INFO L226 Difference]: Without dead ends: 140 [2024-11-28 05:24:49,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:24:49,206 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 5 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:49,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 346 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:24:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-28 05:24:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-28 05:24:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 139 states have internal predecessors, (164), 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 05:24:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2024-11-28 05:24:49,212 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 32 [2024-11-28 05:24:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:49,212 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2024-11-28 05:24:49,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:24:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2024-11-28 05:24:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 05:24:49,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:49,213 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] [2024-11-28 05:24:49,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 05:24:49,214 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:49,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1518385910, now seen corresponding path program 1 times [2024-11-28 05:24:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:49,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373743002] [2024-11-28 05:24:49,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:49,555 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 05:24:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:49,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373743002] [2024-11-28 05:24:49,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373743002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:24:49,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691629428] [2024-11-28 05:24:49,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:49,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:24:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:24:49,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:24:49,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:24:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:49,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 05:24:49,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:24:49,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-28 05:24:49,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:24:50,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-28 05:24:50,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 05:24:50,286 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 05:24:50,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 05:24:50,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:24:50,413 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 6 treesize of output 4 [2024-11-28 05:24:50,473 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 05:24:50,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691629428] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:24:50,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:24:50,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2024-11-28 05:24:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425687401] [2024-11-28 05:24:50,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:24:50,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:24:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:50,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:24:50,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:24:50,476 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 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 05:24:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:50,898 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2024-11-28 05:24:50,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:24:50,899 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 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 33 [2024-11-28 05:24:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:50,900 INFO L225 Difference]: With dead ends: 142 [2024-11-28 05:24:50,900 INFO L226 Difference]: Without dead ends: 142 [2024-11-28 05:24:50,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:24:50,901 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 69 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:50,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 371 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:24:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-28 05:24:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-28 05:24:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 121 states have (on average 1.371900826446281) internal successors, (166), 141 states have internal predecessors, (166), 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 05:24:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2024-11-28 05:24:50,908 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 33 [2024-11-28 05:24:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:50,908 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-11-28 05:24:50,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 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 05:24:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2024-11-28 05:24:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 05:24:50,909 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:50,909 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 05:24:50,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 05:24:51,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 05:24:51,110 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:51,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash 947003805, now seen corresponding path program 1 times [2024-11-28 05:24:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269748349] [2024-11-28 05:24:51,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:51,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:52,230 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 05:24:52,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:52,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269748349] [2024-11-28 05:24:52,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269748349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:52,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:24:52,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:24:52,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886468566] [2024-11-28 05:24:52,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:52,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 05:24:52,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:52,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 05:24:52,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:24:52,235 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 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 05:24:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:24:53,232 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2024-11-28 05:24:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:24:53,233 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 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 05:24:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:24:53,234 INFO L225 Difference]: With dead ends: 159 [2024-11-28 05:24:53,234 INFO L226 Difference]: Without dead ends: 159 [2024-11-28 05:24:53,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:24:53,236 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 270 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:24:53,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 322 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:24:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-28 05:24:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2024-11-28 05:24:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 126 states have (on average 1.373015873015873) internal successors, (173), 146 states have internal predecessors, (173), 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 05:24:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 173 transitions. [2024-11-28 05:24:53,245 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 173 transitions. Word has length 36 [2024-11-28 05:24:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:24:53,246 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 173 transitions. [2024-11-28 05:24:53,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 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 05:24:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 173 transitions. [2024-11-28 05:24:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:24:53,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:24:53,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:24:53,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 05:24:53,247 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:24:53,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:24:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash -707719552, now seen corresponding path program 1 times [2024-11-28 05:24:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:24:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391298665] [2024-11-28 05:24:53,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:24:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:54,502 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 05:24:54,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:24:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391298665] [2024-11-28 05:24:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391298665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:24:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274744653] [2024-11-28 05:24:54,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:24:54,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:24:54,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:24:54,506 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:24:54,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:24:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:24:54,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-28 05:24:54,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:24:54,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 05:24:54,784 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 11 treesize of output 5 [2024-11-28 05:24:54,879 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 15 treesize of output 1 [2024-11-28 05:24:54,886 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 15 treesize of output 1 [2024-11-28 05:24:54,961 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:24:54,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-28 05:24:55,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 11 [2024-11-28 05:24:55,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-28 05:24:55,483 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 29 treesize of output 21 [2024-11-28 05:24:55,511 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 23 treesize of output 15 [2024-11-28 05:24:55,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 53 treesize of output 48 [2024-11-28 05:24:55,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 61 treesize of output 25 [2024-11-28 05:24:56,027 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 05:24:56,041 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 65 treesize of output 42 [2024-11-28 05:24:56,072 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 65 treesize of output 42 [2024-11-28 05:24:56,087 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 05:24:56,971 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 96 treesize of output 52 [2024-11-28 05:24:56,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:24:56,990 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 33 [2024-11-28 05:24:58,117 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:24:58,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-11-28 05:24:58,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:24:58,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2024-11-28 05:24:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:24:58,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:24:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274744653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:24:58,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:24:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [22] total 47 [2024-11-28 05:24:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316935813] [2024-11-28 05:24:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:24:58,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 05:24:58,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:24:58,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 05:24:58,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2014, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 05:24:58,291 INFO L87 Difference]: Start difference. First operand 147 states and 173 transitions. Second operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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 05:25:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:02,413 INFO L93 Difference]: Finished difference Result 162 states and 188 transitions. [2024-11-28 05:25:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 05:25:02,414 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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 37 [2024-11-28 05:25:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:02,415 INFO L225 Difference]: With dead ends: 162 [2024-11-28 05:25:02,416 INFO L226 Difference]: Without dead ends: 162 [2024-11-28 05:25:02,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=356, Invalid=4200, Unknown=0, NotChecked=0, Total=4556 [2024-11-28 05:25:02,418 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 70 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:02,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 794 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 05:25:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-28 05:25:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2024-11-28 05:25:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 134 states have (on average 1.3507462686567164) internal successors, (181), 154 states have internal predecessors, (181), 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 05:25:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2024-11-28 05:25:02,425 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 37 [2024-11-28 05:25:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:02,425 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2024-11-28 05:25:02,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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 05:25:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2024-11-28 05:25:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:25:02,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:02,426 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] [2024-11-28 05:25:02,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:25:02,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 05:25:02,627 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:25:02,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash -705806016, now seen corresponding path program 1 times [2024-11-28 05:25:02,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:02,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37454974] [2024-11-28 05:25:02,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:02,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:02,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37454974] [2024-11-28 05:25:02,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37454974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:02,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:02,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:25:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295513114] [2024-11-28 05:25:02,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:02,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:25:02,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:02,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:25:02,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:25:02,747 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 05:25:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:02,848 INFO L93 Difference]: Finished difference Result 154 states and 177 transitions. [2024-11-28 05:25:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:25:02,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2024-11-28 05:25:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:02,850 INFO L225 Difference]: With dead ends: 154 [2024-11-28 05:25:02,850 INFO L226 Difference]: Without dead ends: 154 [2024-11-28 05:25:02,850 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 05:25:02,851 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:02,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:25:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-28 05:25:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2024-11-28 05:25:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 152 states have internal predecessors, (176), 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 05:25:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2024-11-28 05:25:02,858 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 37 [2024-11-28 05:25:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:02,858 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2024-11-28 05:25:02,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 05:25:02,859 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2024-11-28 05:25:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:25:02,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:02,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:02,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 05:25:02,860 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:25:02,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash -705806015, now seen corresponding path program 1 times [2024-11-28 05:25:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476755584] [2024-11-28 05:25:02,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:02,972 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 05:25:02,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:02,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476755584] [2024-11-28 05:25:02,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476755584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:02,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:02,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:25:02,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954085868] [2024-11-28 05:25:02,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:02,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:25:02,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:02,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:25:02,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:25:02,975 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 05:25:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:03,080 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2024-11-28 05:25:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:25:03,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2024-11-28 05:25:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:03,082 INFO L225 Difference]: With dead ends: 152 [2024-11-28 05:25:03,082 INFO L226 Difference]: Without dead ends: 152 [2024-11-28 05:25:03,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 05:25:03,083 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:03,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 120 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:25:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-28 05:25:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2024-11-28 05:25:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 134 states have (on average 1.2761194029850746) internal successors, (171), 150 states have internal predecessors, (171), 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 05:25:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2024-11-28 05:25:03,089 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 37 [2024-11-28 05:25:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:03,089 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2024-11-28 05:25:03,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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 05:25:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2024-11-28 05:25:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 05:25:03,090 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:03,090 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] [2024-11-28 05:25:03,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 05:25:03,090 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:25:03,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash -930115909, now seen corresponding path program 1 times [2024-11-28 05:25:03,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:03,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058295228] [2024-11-28 05:25:03,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:03,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058295228] [2024-11-28 05:25:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058295228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765105796] [2024-11-28 05:25:05,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:05,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:05,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:05,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:05,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:25:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:05,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-28 05:25:05,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:05,250 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 05:25:05,262 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 11 treesize of output 5 [2024-11-28 05:25:05,275 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 15 treesize of output 1 [2024-11-28 05:25:05,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:25:05,296 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:25:05,297 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 15 treesize of output 15 [2024-11-28 05:25:05,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2024-11-28 05:25:05,352 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 27 treesize of output 11 [2024-11-28 05:25:05,627 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 11 [2024-11-28 05:25:05,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:05,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 34 [2024-11-28 05:25:06,123 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 59 treesize of output 30 [2024-11-28 05:25:06,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 30 [2024-11-28 05:25:07,155 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 7 treesize of output 3 [2024-11-28 05:25:07,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:07,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 16 [2024-11-28 05:25:07,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:07,421 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2024-11-28 05:25:07,611 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 18 treesize of output 13 [2024-11-28 05:25:07,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:07,705 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 12 [2024-11-28 05:25:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:07,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:08,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:08,480 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 49 treesize of output 53 [2024-11-28 05:25:09,125 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-28 05:25:09,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2024-11-28 05:25:09,161 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-11-28 05:25:09,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 89 [2024-11-28 05:25:09,173 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 48 treesize of output 46 [2024-11-28 05:25:09,273 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-28 05:25:09,274 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-11-28 05:25:09,277 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:25:09,299 INFO L349 Elim1Store]: treesize reduction 42, result has 8.7 percent of original size [2024-11-28 05:25:09,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 22 [2024-11-28 05:25:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765105796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:09,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:09,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 63 [2024-11-28 05:25:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551946475] [2024-11-28 05:25:09,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:09,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-28 05:25:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:09,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-28 05:25:09,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=3761, Unknown=9, NotChecked=0, Total=4032 [2024-11-28 05:25:09,900 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand has 64 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 64 states have internal predecessors, (97), 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 05:25:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:12,508 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2024-11-28 05:25:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 05:25:12,511 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 64 states have internal predecessors, (97), 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 38 [2024-11-28 05:25:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:12,512 INFO L225 Difference]: With dead ends: 176 [2024-11-28 05:25:12,512 INFO L226 Difference]: Without dead ends: 176 [2024-11-28 05:25:12,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=422, Invalid=5269, Unknown=9, NotChecked=0, Total=5700 [2024-11-28 05:25:12,515 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 81 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:12,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1476 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 05:25:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-28 05:25:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2024-11-28 05:25:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 152 states have (on average 1.256578947368421) internal successors, (191), 168 states have internal predecessors, (191), 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 05:25:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 191 transitions. [2024-11-28 05:25:12,524 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 191 transitions. Word has length 38 [2024-11-28 05:25:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:12,524 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 191 transitions. [2024-11-28 05:25:12,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 64 states have internal predecessors, (97), 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 05:25:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 191 transitions. [2024-11-28 05:25:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 05:25:12,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:12,525 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] [2024-11-28 05:25:12,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:25:12,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-28 05:25:12,730 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:25:12,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash -930115908, now seen corresponding path program 1 times [2024-11-28 05:25:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:12,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379359981] [2024-11-28 05:25:12,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:12,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:14,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:14,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379359981] [2024-11-28 05:25:14,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379359981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:14,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918244080] [2024-11-28 05:25:14,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:14,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:14,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:14,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:14,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:25:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:14,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-28 05:25:14,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:14,911 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 05:25:14,919 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 11 treesize of output 5 [2024-11-28 05:25:14,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:25:14,941 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 15 treesize of output 1 [2024-11-28 05:25:14,957 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:25:14,958 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 15 treesize of output 15 [2024-11-28 05:25:15,016 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 27 treesize of output 11 [2024-11-28 05:25:15,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-28 05:25:15,300 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 11 [2024-11-28 05:25:15,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-28 05:25:15,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:15,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 49 treesize of output 21 [2024-11-28 05:25:15,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:15,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 34 [2024-11-28 05:25:15,755 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 38 treesize of output 21 [2024-11-28 05:25:15,764 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 57 treesize of output 34 [2024-11-28 05:25:15,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2024-11-28 05:25:15,943 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 57 treesize of output 34 [2024-11-28 05:25:16,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:16,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 22 [2024-11-28 05:25:16,971 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 29 treesize of output 13 [2024-11-28 05:25:17,064 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2024-11-28 05:25:17,072 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-11-28 05:25:17,287 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 38 treesize of output 18 [2024-11-28 05:25:17,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:17,291 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 17 [2024-11-28 05:25:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:17,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:18,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:18,296 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 61 treesize of output 65 [2024-11-28 05:25:18,984 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-11-28 05:25:18,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 59 [2024-11-28 05:25:18,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:18,999 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 85 [2024-11-28 05:25:19,050 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 11 treesize of output 9 [2024-11-28 05:25:19,082 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-28 05:25:19,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-11-28 05:25:19,087 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:25:19,099 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-28 05:25:19,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 18 [2024-11-28 05:25:19,133 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-28 05:25:19,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 39 [2024-11-28 05:25:19,138 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:25:19,142 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 05:25:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:20,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918244080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:20,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:20,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2024-11-28 05:25:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999390134] [2024-11-28 05:25:20,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:20,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-28 05:25:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:20,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-28 05:25:20,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=4273, Unknown=18, NotChecked=0, Total=4556 [2024-11-28 05:25:20,079 INFO L87 Difference]: Start difference. First operand 169 states and 191 transitions. Second operand has 68 states, 67 states have (on average 1.626865671641791) internal successors, (109), 68 states have internal predecessors, (109), 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 05:25:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:23,820 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2024-11-28 05:25:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 05:25:23,820 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.626865671641791) internal successors, (109), 68 states have internal predecessors, (109), 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 38 [2024-11-28 05:25:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:23,822 INFO L225 Difference]: With dead ends: 175 [2024-11-28 05:25:23,822 INFO L226 Difference]: Without dead ends: 175 [2024-11-28 05:25:23,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1636 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=496, Invalid=6968, Unknown=18, NotChecked=0, Total=7482 [2024-11-28 05:25:23,825 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 98 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:23,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1514 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 05:25:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-28 05:25:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 169. [2024-11-28 05:25:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 152 states have (on average 1.25) internal successors, (190), 168 states have internal predecessors, (190), 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 05:25:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2024-11-28 05:25:23,832 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 38 [2024-11-28 05:25:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:23,833 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2024-11-28 05:25:23,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.626865671641791) internal successors, (109), 68 states have internal predecessors, (109), 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 05:25:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2024-11-28 05:25:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 05:25:23,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:23,834 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 05:25:23,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:25:24,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 05:25:24,035 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:25:24,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:24,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1311309831, now seen corresponding path program 1 times [2024-11-28 05:25:24,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:24,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103303860] [2024-11-28 05:25:24,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:24,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:25,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103303860] [2024-11-28 05:25:25,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103303860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:25,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791984611] [2024-11-28 05:25:25,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:25,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:25,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:25,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:25,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:25:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:25,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-28 05:25:25,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:25,685 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 05:25:25,699 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 11 treesize of output 5 [2024-11-28 05:25:25,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:25:25,780 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 15 treesize of output 1 [2024-11-28 05:25:25,866 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:25:25,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-28 05:25:25,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 16 [2024-11-28 05:25:25,945 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 23 treesize of output 11 [2024-11-28 05:25:26,319 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 11 [2024-11-28 05:25:26,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:26,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2024-11-28 05:25:26,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 49 treesize of output 30 [2024-11-28 05:25:26,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 49 treesize of output 30 [2024-11-28 05:25:27,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:27,929 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2024-11-28 05:25:28,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:28,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:28,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 60 [2024-11-28 05:25:28,359 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-11-28 05:25:28,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 64 treesize of output 63 [2024-11-28 05:25:28,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:28,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 53 treesize of output 45 [2024-11-28 05:25:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:29,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:31,008 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-28 05:25:31,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 40 [2024-11-28 05:25:31,045 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-11-28 05:25:31,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 81 [2024-11-28 05:25:31,051 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 40 treesize of output 38 [2024-11-28 05:25:32,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-28 05:25:32,132 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 14 treesize of output 12 [2024-11-28 05:25:32,140 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 16 treesize of output 14 [2024-11-28 05:25:32,144 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 46 treesize of output 44 [2024-11-28 05:25:32,171 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 16 treesize of output 14 [2024-11-28 05:25:32,177 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 118 treesize of output 114 [2024-11-28 05:25:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:32,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791984611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:32,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:32,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27, 27] total 74 [2024-11-28 05:25:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053931892] [2024-11-28 05:25:32,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:32,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-28 05:25:32,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:32,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-28 05:25:32,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=5109, Unknown=14, NotChecked=0, Total=5402 [2024-11-28 05:25:32,341 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand has 74 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 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 05:25:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:35,613 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2024-11-28 05:25:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 05:25:35,614 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-28 05:25:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:35,615 INFO L225 Difference]: With dead ends: 174 [2024-11-28 05:25:35,615 INFO L226 Difference]: Without dead ends: 174 [2024-11-28 05:25:35,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=541, Invalid=8187, Unknown=14, NotChecked=0, Total=8742 [2024-11-28 05:25:35,620 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 105 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:35,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2302 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 05:25:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-28 05:25:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2024-11-28 05:25:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 152 states have (on average 1.243421052631579) internal successors, (189), 168 states have internal predecessors, (189), 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 05:25:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 189 transitions. [2024-11-28 05:25:35,625 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 189 transitions. Word has length 39 [2024-11-28 05:25:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:35,625 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 189 transitions. [2024-11-28 05:25:35,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 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 05:25:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 189 transitions. [2024-11-28 05:25:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:25:35,626 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:35,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:35,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 05:25:35,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-28 05:25:35,831 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:25:35,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2046088882, now seen corresponding path program 1 times [2024-11-28 05:25:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:35,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893929403] [2024-11-28 05:25:35,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:35,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:37,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:37,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893929403] [2024-11-28 05:25:37,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893929403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:37,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114904706] [2024-11-28 05:25:37,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:37,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:37,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:37,227 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:37,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:25:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:37,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-28 05:25:37,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:37,505 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 11 treesize of output 5 [2024-11-28 05:25:37,520 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 05:25:37,537 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 15 treesize of output 1 [2024-11-28 05:25:37,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:25:37,558 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:25:37,558 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 15 treesize of output 15 [2024-11-28 05:25:37,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-28 05:25:37,629 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 27 treesize of output 11 [2024-11-28 05:25: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 27 treesize of output 1 [2024-11-28 05:25:38,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:38,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 49 treesize of output 21 [2024-11-28 05:25:38,412 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 38 treesize of output 21 [2024-11-28 05:25:38,445 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 38 treesize of output 21 [2024-11-28 05:25:38,920 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 39 treesize of output 21 [2024-11-28 05:25:39,015 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 21 treesize of output 13 [2024-11-28 05:25:39,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:39,108 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 23 [2024-11-28 05:25:39,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:39,437 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2024-11-28 05:25:39,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:39,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:41,124 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-11-28 05:25:41,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2024-11-28 05:25:41,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:41,141 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 69 [2024-11-28 05:25:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:41,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114904706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:41,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:41,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 27] total 71 [2024-11-28 05:25:41,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140002507] [2024-11-28 05:25:41,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:41,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-11-28 05:25:41,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:41,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-11-28 05:25:41,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=4783, Unknown=14, NotChecked=0, Total=5112 [2024-11-28 05:25:41,992 INFO L87 Difference]: Start difference. First operand 169 states and 189 transitions. Second operand has 72 states, 71 states have (on average 1.591549295774648) internal successors, (113), 72 states have internal predecessors, (113), 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 05:25:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:44,817 INFO L93 Difference]: Finished difference Result 176 states and 196 transitions. [2024-11-28 05:25:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 05:25:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.591549295774648) internal successors, (113), 72 states have internal predecessors, (113), 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 41 [2024-11-28 05:25:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:44,818 INFO L225 Difference]: With dead ends: 176 [2024-11-28 05:25:44,818 INFO L226 Difference]: Without dead ends: 176 [2024-11-28 05:25:44,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2008 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=615, Invalid=7743, Unknown=14, NotChecked=0, Total=8372 [2024-11-28 05:25:44,821 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 79 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:44,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 2000 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 05:25:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-28 05:25:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2024-11-28 05:25:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 155 states have (on average 1.238709677419355) internal successors, (192), 171 states have internal predecessors, (192), 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 05:25:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 192 transitions. [2024-11-28 05:25:44,827 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 192 transitions. Word has length 41 [2024-11-28 05:25:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:44,828 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 192 transitions. [2024-11-28 05:25:44,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.591549295774648) internal successors, (113), 72 states have internal predecessors, (113), 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 05:25:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 192 transitions. [2024-11-28 05:25:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-28 05:25:44,829 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:44,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:44,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:25:45,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-28 05:25:45,034 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:25:45,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash -995753890, now seen corresponding path program 1 times [2024-11-28 05:25:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:45,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221556193] [2024-11-28 05:25:45,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:46,563 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 05:25:46,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:46,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221556193] [2024-11-28 05:25:46,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221556193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:46,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384455283] [2024-11-28 05:25:46,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:46,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:46,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:46,566 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:46,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:25:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:46,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-28 05:25:46,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:46,854 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 05:25:46,870 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 11 treesize of output 5 [2024-11-28 05:25:46,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:25:46,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:25:47,044 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:25:47,044 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 15 treesize of output 15 [2024-11-28 05:25:47,136 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 43 treesize of output 23 [2024-11-28 05:25:47,145 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 27 treesize of output 11 [2024-11-28 05:25:47,561 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 11 [2024-11-28 05:25:47,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:47,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 34 [2024-11-28 05:25:48,111 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 59 treesize of output 30 [2024-11-28 05:25:48,154 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 59 treesize of output 30 [2024-11-28 05:25:49,231 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 7 treesize of output 3 [2024-11-28 05:25:49,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:25:49,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 16 [2024-11-28 05:25:49,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:49,567 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 31 [2024-11-28 05:25:49,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:49,822 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-11-28 05:25:49,839 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 05:25:49,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:51,036 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-28 05:25:51,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 39 [2024-11-28 05:25:51,077 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-11-28 05:25:51,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 78 [2024-11-28 05:25:51,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-28 05:25:51,777 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 05:25:51,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384455283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:51,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:51,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 62 [2024-11-28 05:25:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423952290] [2024-11-28 05:25:51,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:51,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-28 05:25:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:51,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-28 05:25:51,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=3624, Unknown=9, NotChecked=0, Total=3906 [2024-11-28 05:25:51,780 INFO L87 Difference]: Start difference. First operand 172 states and 192 transitions. Second operand has 63 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 63 states have internal predecessors, (101), 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 05:25:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:25:54,382 INFO L93 Difference]: Finished difference Result 177 states and 197 transitions. [2024-11-28 05:25:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 05:25:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 63 states have internal predecessors, (101), 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 42 [2024-11-28 05:25:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:25:54,384 INFO L225 Difference]: With dead ends: 177 [2024-11-28 05:25:54,384 INFO L226 Difference]: Without dead ends: 177 [2024-11-28 05:25:54,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=473, Invalid=5524, Unknown=9, NotChecked=0, Total=6006 [2024-11-28 05:25:54,385 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 61 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:25:54,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1667 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 05:25:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-28 05:25:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2024-11-28 05:25:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 156 states have (on average 1.2371794871794872) internal successors, (193), 172 states have internal predecessors, (193), 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 05:25:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 193 transitions. [2024-11-28 05:25:54,391 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 193 transitions. Word has length 42 [2024-11-28 05:25:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:25:54,391 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 193 transitions. [2024-11-28 05:25:54,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 63 states have internal predecessors, (101), 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 05:25:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 193 transitions. [2024-11-28 05:25:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 05:25:54,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:25:54,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:54,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:25:54,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-28 05:25:54,597 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:25:54,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash 858225412, now seen corresponding path program 2 times [2024-11-28 05:25:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:54,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331986307] [2024-11-28 05:25:54,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:54,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:54,632 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:25:54,632 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:56,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:56,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331986307] [2024-11-28 05:25:56,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331986307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:56,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101808359] [2024-11-28 05:25:56,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:56,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:56,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:56,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:56,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:25:56,308 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:25:56,308 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:56,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-28 05:25:56,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:56,324 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 11 treesize of output 5 [2024-11-28 05:25:56,334 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 05:25:56,384 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 15 treesize of output 1 [2024-11-28 05:25:56,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:25:56,454 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-28 05:25:56,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2024-11-28 05:25:56,508 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 23 treesize of output 11 [2024-11-28 05:25:56,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 16 [2024-11-28 05:25:56,777 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 11 [2024-11-28 05:25:56,865 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-28 05:25:56,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 41 treesize of output 36 [2024-11-28 05:25:57,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 49 treesize of output 30 [2024-11-28 05:25:57,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 49 treesize of output 30 [2024-11-28 05:25:57,832 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 7 treesize of output 3 [2024-11-28 05:25:58,018 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-28 05:25:58,018 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 1 case distinctions, treesize of input 44 treesize of output 18 [2024-11-28 05:25:58,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:25:58,131 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-28 05:25:58,372 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 27 treesize of output 11 [2024-11-28 05:25:58,416 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 05:25:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:58,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:58,545 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 6 treesize of output 4 [2024-11-28 05:25:59,459 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-28 05:25:59,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 40 [2024-11-28 05:25:59,494 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-11-28 05:25:59,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 81 [2024-11-28 05:25:59,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-28 05:26:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:00,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101808359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:00,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:00,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 65 [2024-11-28 05:26:00,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72217484] [2024-11-28 05:26:00,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:00,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-28 05:26:00,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:00,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-28 05:26:00,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=4003, Unknown=12, NotChecked=0, Total=4290 [2024-11-28 05:26:00,029 INFO L87 Difference]: Start difference. First operand 173 states and 193 transitions. Second operand has 66 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 66 states have internal predecessors, (103), 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 05:26:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:26:02,521 INFO L93 Difference]: Finished difference Result 179 states and 199 transitions. [2024-11-28 05:26:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 05:26:02,521 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 66 states have internal predecessors, (103), 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 44 [2024-11-28 05:26:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:26:02,522 INFO L225 Difference]: With dead ends: 179 [2024-11-28 05:26:02,522 INFO L226 Difference]: Without dead ends: 179 [2024-11-28 05:26:02,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=500, Invalid=6294, Unknown=12, NotChecked=0, Total=6806 [2024-11-28 05:26:02,523 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 122 mSDsluCounter, 1859 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:26:02,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1918 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 05:26:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-28 05:26:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2024-11-28 05:26:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 146 states have (on average 1.2534246575342465) internal successors, (183), 162 states have internal predecessors, (183), 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 05:26:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 183 transitions. [2024-11-28 05:26:02,527 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 183 transitions. Word has length 44 [2024-11-28 05:26:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:26:02,528 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 183 transitions. [2024-11-28 05:26:02,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 66 states have internal predecessors, (103), 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 05:26:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 183 transitions. [2024-11-28 05:26:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-28 05:26:02,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:26:02,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:02,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 05:26:02,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 05:26:02,730 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:26:02,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:02,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1621359359, now seen corresponding path program 2 times [2024-11-28 05:26:02,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:02,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797234219] [2024-11-28 05:26:02,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:26:02,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:02,770 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:26:02,770 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797234219] [2024-11-28 05:26:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797234219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874805465] [2024-11-28 05:26:04,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:26:04,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:04,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:04,785 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:04,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:26:05,128 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:26:05,128 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:05,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-28 05:26:05,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:05,149 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 05:26:05,157 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 11 treesize of output 5 [2024-11-28 05:26:05,172 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 15 treesize of output 1 [2024-11-28 05:26:05,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:26:05,194 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:26:05,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-28 05:26:05,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 28 treesize of output 16 [2024-11-28 05:26:05,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 19 treesize of output 18 [2024-11-28 05:26:05,547 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 11 [2024-11-28 05:26:05,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:05,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 36 [2024-11-28 05:26:06,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:06,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-11-28 05:26:06,198 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 11 [2024-11-28 05:26:06,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:06,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 15 [2024-11-28 05:26:06,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:06,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:06,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 53 [2024-11-28 05:26:07,483 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 15 treesize of output 7 [2024-11-28 05:26:07,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:07,819 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 53 [2024-11-28 05:26:08,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:08,861 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 1 case distinctions, treesize of input 29 treesize of output 19 [2024-11-28 05:26:08,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:08,892 INFO L349 Elim1Store]: treesize reduction 59, result has 16.9 percent of original size [2024-11-28 05:26:08,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 43 [2024-11-28 05:26:08,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:08,995 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 05:26:09,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 55 treesize of output 28 [2024-11-28 05:26:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:09,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:09,421 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 8 treesize of output 4 [2024-11-28 05:26:10,262 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 311 treesize of output 273 [2024-11-28 05:26:11,327 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:26:11,330 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 282 treesize of output 274 [2024-11-28 05:26:11,436 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:26:11,461 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2024-11-28 05:26:11,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 7332 treesize of output 1 [2024-11-28 05:26:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874805465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:12,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:12,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 30] total 74 [2024-11-28 05:26:12,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208181141] [2024-11-28 05:26:12,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:12,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-28 05:26:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:12,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-28 05:26:12,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=5095, Unknown=0, NotChecked=0, Total=5402 [2024-11-28 05:26:12,311 INFO L87 Difference]: Start difference. First operand 163 states and 183 transitions. Second operand has 74 states, 74 states have (on average 1.554054054054054) internal successors, (115), 74 states have internal predecessors, (115), 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 05:26:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:26:15,285 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2024-11-28 05:26:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 05:26:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.554054054054054) internal successors, (115), 74 states have internal predecessors, (115), 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 49 [2024-11-28 05:26:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:26:15,286 INFO L225 Difference]: With dead ends: 181 [2024-11-28 05:26:15,286 INFO L226 Difference]: Without dead ends: 181 [2024-11-28 05:26:15,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2102 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=490, Invalid=7342, Unknown=0, NotChecked=0, Total=7832 [2024-11-28 05:26:15,288 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 86 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:26:15,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2112 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 05:26:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-28 05:26:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2024-11-28 05:26:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 159 states have (on average 1.2327044025157232) internal successors, (196), 175 states have internal predecessors, (196), 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 05:26:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 196 transitions. [2024-11-28 05:26:15,292 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 196 transitions. Word has length 49 [2024-11-28 05:26:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:26:15,293 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 196 transitions. [2024-11-28 05:26:15,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 1.554054054054054) internal successors, (115), 74 states have internal predecessors, (115), 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 05:26:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 196 transitions. [2024-11-28 05:26:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 05:26:15,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:26:15,294 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:15,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:26:15,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-28 05:26:15,494 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:26:15,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1357599361, now seen corresponding path program 2 times [2024-11-28 05:26:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:15,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417773925] [2024-11-28 05:26:15,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:26:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:15,531 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:26:15,531 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:18,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:18,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417773925] [2024-11-28 05:26:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417773925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:18,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163476842] [2024-11-28 05:26:18,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:26:18,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:18,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:18,473 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:18,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:26:18,799 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:26:18,799 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:18,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-28 05:26:18,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:18,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:26:18,984 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 15 treesize of output 1 [2024-11-28 05:26:19,387 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 19 treesize of output 18 [2024-11-28 05:26:19,404 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 207 treesize of output 159 [2024-11-28 05:26:20,904 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 11 [2024-11-28 05:26:21,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:21,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2024-11-28 05:26:22,400 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2024-11-28 05:26:22,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2024-11-28 05:26:22,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:22,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-28 05:26:22,822 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2024-11-28 05:26:22,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2024-11-28 05:26:22,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:22,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-28 05:26:25,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:25,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 29 [2024-11-28 05:26:26,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:26:26,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:26,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 60 [2024-11-28 05:26:26,641 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-11-28 05:26:26,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 242 treesize of output 165 [2024-11-28 05:26:37,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:26:37,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 897 treesize of output 557 [2024-11-28 05:27:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:27:49,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:28:04,199 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-28 05:28:04,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 89 [2024-11-28 05:28:04,290 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2024-11-28 05:28:04,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 176 [2024-11-28 05:28:04,301 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 101 treesize of output 97 [2024-11-28 05:28:25,619 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 68 treesize of output 62 [2024-11-28 05:28:25,623 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 456 treesize of output 444 [2024-11-28 05:28:26,006 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 103 treesize of output 95 [2024-11-28 05:28:26,013 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 347 treesize of output 339 [2024-11-28 05:28:26,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 111 [2024-11-28 05:28:26,321 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 406 treesize of output 396 [2024-11-28 05:28:26,825 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 74 treesize of output 68 [2024-11-28 05:28:26,831 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 504 treesize of output 492 [2024-11-28 05:28:27,321 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 105 treesize of output 97 [2024-11-28 05:28:27,331 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 729 treesize of output 713 [2024-11-28 05:28:28,022 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 106 treesize of output 98 [2024-11-28 05:28:28,028 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 359 treesize of output 351 [2024-11-28 05:28:29,582 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 75 treesize of output 69 [2024-11-28 05:28:29,588 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 509 treesize of output 497 [2024-11-28 05:28:29,821 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 115 treesize of output 105 [2024-11-28 05:28:29,829 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 742 treesize of output 724 [2024-11-28 05:28:29,875 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 84 treesize of output 76 [2024-11-28 05:28:29,880 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 260 treesize of output 252 [2024-11-28 05:28:29,916 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 99 treesize of output 91 [2024-11-28 05:28:29,922 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 332 treesize of output 324 [2024-11-28 05:28:31,652 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 16 treesize of output 14 [2024-11-28 05:28:31,657 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 46 treesize of output 44 [2024-11-28 05:30:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:30:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163476842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:30:08,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:30:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 31] total 87 [2024-11-28 05:30:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106624333] [2024-11-28 05:30:08,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:30:08,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2024-11-28 05:30:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:30:08,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2024-11-28 05:30:08,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=7308, Unknown=55, NotChecked=0, Total=7656 [2024-11-28 05:30:08,125 INFO L87 Difference]: Start difference. First operand 176 states and 196 transitions. Second operand has 88 states, 87 states have (on average 1.6551724137931034) internal successors, (144), 88 states have internal predecessors, (144), 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 05:30:32,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:30:45,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:30:54,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:30:58,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:02,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:06,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:11,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:20,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:25,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:29,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:33,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:37,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:42,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:52,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:31:56,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:32:05,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:32:09,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:32:18,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:32:23,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:32:31,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:32:36,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:32:40,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:32:49,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:32:54,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:32:58,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:33:02,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:33:12,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:33:16,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:33:20,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:33:25,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:33:36,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:33:40,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:33:45,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:33:56,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:34:00,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:34:05,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:34:09,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:34:14,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:34:30,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:34:35,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:34:35,694 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (.cse25 (select .cse26 |c_ULTIMATE.start_destroy_sl_~sl#1.offset|))) (and (= (store .cse0 |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (let ((.cse3 (select .cse26 4)) (.cse10 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| 1)) (.cse7 (select .cse26 0))) (let ((.cse16 (store .cse10 .cse7 1)) (.cse11 (select |c_#valid| .cse3))) (let ((.cse19 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 4)) (.cse14 (store .cse16 .cse3 .cse11))) (let ((.cse5 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse7) 0)) (.cse4 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 0)) (.cse8 (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse14 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) .cse7 1) .cse3) 0)) (.cse6 (exists ((v_DerPreprocessor_1 Int)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) .cse7 1) .cse3) 0))) (.cse1 (not .cse19)) (.cse12 (= .cse25 .cse3))) (or (and .cse1 (let ((.cse2 (store |c_ULTIMATE.start_main_old_#valid#1| .cse3 .cse11)) (.cse9 (store .cse10 .cse3 .cse11))) (or (and (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int) (v_DerPreprocessor_1 Int)) (and (= |c_#valid| (store .cse2 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 1) .cse3) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|) 0))) .cse4) (and .cse5 .cse6 (= |c_#valid| (store .cse2 .cse7 0))) (and .cse5 .cse8 (= |c_#valid| (store .cse9 .cse7 0))) (and (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int)) (and (= |c_#valid| (store .cse9 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse10 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 1) .cse3 .cse11) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 1) .cse3) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|) 0))) .cse4))) .cse12) (and .cse5 (not .cse4) (let ((.cse17 (store |c_ULTIMATE.start_main_old_#valid#1| .cse7 1))) (let ((.cse24 (store .cse17 .cse3 .cse11))) (let ((.cse21 (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int)) (= |c_#valid| (store .cse24 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0)))) (.cse23 (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse7))) (let ((.cse13 (not .cse23)) (.cse20 (and .cse21 .cse12))) (or (and .cse13 (let ((.cse15 (and (exists ((v_DerPreprocessor_13 Int)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse16 .cse3 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) .cse7 1) .cse3) 0)) (= |c_#valid| (store .cse16 .cse3 0))))) (or (and (or (and .cse8 (or (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int)) (and (not (= |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| .cse3)) (not (= .cse7 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|)) (= |c_#valid| (store .cse14 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0)))) (and (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int)) (and (not (= |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| .cse3)) (= |c_#valid| (store .cse14 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0)))) .cse12))) .cse15) .cse1) .cse15))) (and (or (and .cse13 (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int) (v_DerPreprocessor_8 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse16 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) .cse7 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|) 0) (= |c_#valid| (store .cse16 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0))))) (exists ((v_prenex_5 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int)) (let ((.cse18 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_5) .cse7 1))) (and (= |c_#valid| (store .cse17 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0)) (= (select .cse18 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|) 0) (= (select .cse18 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) v_prenex_5))))) .cse19) (and (or (and .cse1 (or .cse20 .cse21)) (= |c_#valid| (store .cse17 .cse3 0))) (exists ((v_prenex_5 Int)) (let ((.cse22 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_5) .cse7 1))) (and (= (select .cse22 .cse3) 0) (= (select .cse22 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) v_prenex_5)))) .cse23) (and (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse3) .cse6 (or (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int)) (and (= |c_#valid| (store .cse24 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0)) (not (= .cse7 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|)))) .cse20) .cse1)))))))))))) (= |c_ULTIMATE.start_main_old_#valid#1| (store .cse0 .cse25 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0) (= (select |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse25)) (= |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| .cse25)))) is different from true [2024-11-28 05:34:53,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:34:55,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:35:01,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:35:05,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:35:10,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:35:15,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:35:21,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:36:03,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:36:07,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:36:21,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:36:22,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:36:28,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 0))) (let ((.cse3 (not .cse0)) (.cse5 (not .cse12)) (.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| 1))) (and (or (and (or (and (exists ((v_prenex_23 Int) (v_DerPreprocessor_17 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_prenex_24 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_prenex_23) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_23 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_17) v_prenex_23 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_24) v_prenex_23 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0))) .cse0) (and (or (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_16 Int)) (let ((.cse2 (store (store .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_16) v_arrayElimCell_210 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse1 v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| (select .cse2 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= |c_#valid| (store (store .cse1 v_arrayElimCell_210 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select .cse2 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0)))) (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_15 Int) (v_prenex_21 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_21) v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_15) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0)))) .cse3) (and (exists ((v_DerPreprocessor_14 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int)) (let ((.cse4 (store (store .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_14) v_prenex_22 0))) (and (= |c_#valid| (store (store .cse1 v_prenex_22 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse1 v_prenex_22 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| (select .cse4 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_prenex_22 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_prenex_22) 0) (= 1 (select .cse4 |c_ULTIMATE.start_destroy_sl_~sl#1.base|))))) .cse0)) .cse5) (and .cse3 (or (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_prenex_13 Int)) (let ((.cse7 (store .cse1 v_arrayElimCell_210 1))) (let ((.cse6 (store .cse7 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0))) (and (= (select .cse6 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| .cse6) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse7 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0))))) (and (or (exists ((v_prenex_5 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_prenex_14 Int)) (let ((.cse8 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_5) v_arrayElimCell_210 1)) (.cse9 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 1) v_prenex_14 0))) (and (= (select .cse8 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) v_prenex_5) (= (select .cse8 v_prenex_14) 0) (= (select .cse9 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store .cse9 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0))))) (exists ((v_prenex_17 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse11 (store .cse1 v_arrayElimCell_210 1))) (let ((.cse10 (store .cse11 v_prenex_17 0))) (and (= (select .cse10 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store .cse10 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse11 v_prenex_17 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) v_prenex_17) 0)))))) .cse12) (and .cse5 (or (exists ((v_prenex_16 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_DerPreprocessor_18 Int)) (let ((.cse13 (store (store .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_18) v_prenex_16 0))) (and (= |c_#valid| (store (store .cse1 v_prenex_16 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= v_DerPreprocessor_18 (select .cse13 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) (= (select .cse13 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1)))) (exists ((v_prenex_16 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_211 Int)) (let ((.cse14 (store (store .cse1 v_arrayElimCell_211 (select |c_#valid| v_arrayElimCell_211)) v_prenex_16 0))) (and (= |c_#valid| (store .cse14 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= v_arrayElimCell_211 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) (not (= v_prenex_16 v_arrayElimCell_211)) (= (select .cse1 v_arrayElimCell_211) 0) (= (select .cse14 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1)))) (exists ((v_prenex_16 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int)) (and (= |c_#valid| (store (store .cse1 v_prenex_16 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select .cse1 v_prenex_16) 0))) (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_DerPreprocessor_19 Int) (v_prenex_20 Int)) (let ((.cse15 (store (store .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_19) v_prenex_20 0))) (and (= (select .cse15 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) v_DerPreprocessor_19) (= (select .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= |c_#valid| (store (store .cse1 v_prenex_20 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select .cse15 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1)))))) (and (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_prenex_13 Int) (v_arrayElimCell_211 Int)) (let ((.cse17 (store .cse1 v_arrayElimCell_210 1))) (let ((.cse16 (store .cse17 v_arrayElimCell_211 0))) (and (= (select .cse16 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse17 v_arrayElimCell_211 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) v_arrayElimCell_211) 0) (= |c_#valid| (store .cse16 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0))))) .cse5) (and (or (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_arrayElimCell_211 Int)) (let ((.cse19 (store .cse1 v_arrayElimCell_210 1))) (let ((.cse18 (store .cse19 v_arrayElimCell_211 0))) (and (= (select .cse18 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse19 v_arrayElimCell_211 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) v_arrayElimCell_211) 0) (= |c_#valid| (store .cse18 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0))))) (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_21 Int)) (let ((.cse20 (store .cse1 v_arrayElimCell_210 1))) (let ((.cse21 (store (store .cse20 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_21) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse20 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| (select .cse21 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= |c_#valid| (store (store .cse20 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select .cse21 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (not (= v_arrayElimCell_210 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0) (not (= |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|)))))) (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_arrayElimCell_211 Int)) (let ((.cse23 (store .cse1 v_arrayElimCell_210 1))) (let ((.cse22 (store (store .cse23 v_arrayElimCell_211 (select |c_#valid| v_arrayElimCell_211)) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0))) (and (= |c_#valid| (store .cse22 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select .cse22 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (not (= v_arrayElimCell_211 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse23 v_arrayElimCell_211 (select .cse22 v_arrayElimCell_211)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) v_arrayElimCell_211) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|)) (not (= v_arrayElimCell_211 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0))))) (exists ((v_prenex_12 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_20 Int)) (let ((.cse24 (store .cse1 v_arrayElimCell_210 1))) (let ((.cse25 (store (store .cse24 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_20) v_prenex_12 0))) (and (= |c_#valid| (store (store .cse24 v_prenex_12 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select .cse25 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (not (= v_prenex_12 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse24 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| (select .cse25 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0)))))) .cse5) (and .cse5 (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_211 Int)) (let ((.cse26 (store .cse1 v_arrayElimCell_211 0))) (and (= |c_#valid| (store .cse26 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0) (= (select .cse26 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1))))) (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int)) (let ((.cse27 (store .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0))) (and (= (select .cse27 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= |c_#valid| .cse27)))) (and .cse5 (or (exists ((v_prenex_18 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (let ((.cse28 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 1) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 1) v_prenex_18 0))) (and (not (= v_prenex_18 v_arrayElimCell_210)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_210 1) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0) (= (select .cse28 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store .cse28 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0)))) (exists ((v_prenex_15 Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (let ((.cse29 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 1))) (and (= (select (store (store .cse29 |c_ULTIMATE.start_destroy_sl_~sl#1.base| 1) v_prenex_15 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= |c_#valid| (store (store .cse29 v_prenex_15 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_210 1) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0))))))))) (<= 0 |c_ULTIMATE.start_destroy_sl_~sl#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0) (= (select |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 1) (= (store |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (or (and (or (and (exists ((v_DerPreprocessor_14 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int)) (and (= |c_#valid| (store (store .cse1 v_prenex_22 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse1 v_prenex_22 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| (select (store (store .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_14) v_prenex_22 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_prenex_22 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_prenex_22) 0))) .cse0) (and .cse3 (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_16 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse1 v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| (select (store (store .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_16) v_arrayElimCell_210 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= |c_#valid| (store (store .cse1 v_arrayElimCell_210 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0))))) .cse5) (and .cse3 (or (and .cse5 (exists ((v_prenex_18 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (and (not (= v_prenex_18 v_arrayElimCell_210)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_210 1) |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 1) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 1) v_prenex_18 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0)))) (and .cse5 (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_211 Int)) (and (= |c_#valid| (store (store .cse1 v_arrayElimCell_211 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_211) 0)))) (and .cse5 (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_prenex_13 Int) (v_arrayElimCell_211 Int)) (let ((.cse30 (store .cse1 v_arrayElimCell_210 1))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse30 v_arrayElimCell_211 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) v_arrayElimCell_211) 0) (= |c_#valid| (store (store .cse30 v_arrayElimCell_211 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0))))) (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= |c_#valid| (store .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)))) (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_prenex_13 Int)) (let ((.cse31 (store .cse1 v_arrayElimCell_210 1))) (and (= |c_#valid| (store .cse31 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse31 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0)))) (and (or (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_arrayElimCell_211 Int)) (let ((.cse32 (store .cse1 v_arrayElimCell_210 1))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse32 v_arrayElimCell_211 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) v_arrayElimCell_211) 0) (= |c_#valid| (store (store .cse32 v_arrayElimCell_211 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0)))) (exists ((v_prenex_12 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_20 Int)) (let ((.cse33 (store .cse1 v_arrayElimCell_210 1))) (and (= |c_#valid| (store (store .cse33 v_prenex_12 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= v_prenex_12 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse33 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| (select (store (store .cse33 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_20) v_prenex_12 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0)))) (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_arrayElimCell_211 Int)) (let ((.cse35 (store .cse1 v_arrayElimCell_210 1))) (let ((.cse34 (store (store .cse35 v_arrayElimCell_211 (select |c_#valid| v_arrayElimCell_211)) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0))) (and (= |c_#valid| (store .cse34 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= v_arrayElimCell_211 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse35 v_arrayElimCell_211 (select .cse34 v_arrayElimCell_211)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) v_arrayElimCell_211) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|)) (not (= v_arrayElimCell_211 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0))))) (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_21 Int)) (let ((.cse36 (store .cse1 v_arrayElimCell_210 1))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse36 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| (select (store (store .cse36 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_21) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0) (= |c_#valid| (store (store .cse36 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36| 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0) (not (= |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_36|)))))) .cse5) (and .cse5 (or (exists ((v_prenex_16 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_DerPreprocessor_18 Int)) (and (= |c_#valid| (store (store .cse1 v_prenex_16 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= v_DerPreprocessor_18 (select (store (store .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_18) v_prenex_16 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0))) (exists ((|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_DerPreprocessor_19 Int) (v_prenex_20 Int)) (and (= (select (store (store .cse1 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| v_DerPreprocessor_19) v_prenex_20 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) v_DerPreprocessor_19) (= |c_#valid| (store (store .cse1 v_prenex_20 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|) 0))) (exists ((v_prenex_16 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_211 Int)) (and (= |c_#valid| (store (store (store .cse1 v_arrayElimCell_211 (select |c_#valid| v_arrayElimCell_211)) v_prenex_16 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= v_arrayElimCell_211 |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37|)) (not (= v_prenex_16 v_arrayElimCell_211)) (= (select .cse1 v_arrayElimCell_211) 0))) (exists ((v_prenex_16 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int)) (and (= |c_#valid| (store (store .cse1 v_prenex_16 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_prenex_16) 0))))) (and (or (exists ((v_prenex_17 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse37 (store .cse1 v_arrayElimCell_210 1))) (and (= |c_#valid| (store (store .cse37 v_prenex_17 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store .cse37 v_prenex_17 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_210 1) v_prenex_17) 0)))) (exists ((v_prenex_5 Int) (|v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| Int) (v_arrayElimCell_210 Int) (v_prenex_14 Int)) (let ((.cse38 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_5) v_arrayElimCell_210 1))) (and (= (select .cse38 |c_ULTIMATE.start_destroy_sl_~sl#1.base|) v_prenex_5) (= (select .cse38 v_prenex_14) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 1) v_prenex_14 0) |v_ULTIMATE.start_destroy_sl_~tmp~0#1.base_37| 0)))))) .cse12))))))) is different from false [2024-11-28 05:37:06,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:37:11,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:37:15,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:37:19,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:37:24,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 05:37:29,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 05:37:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:37:29,992 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2024-11-28 05:37:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 05:37:29,992 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 87 states have (on average 1.6551724137931034) internal successors, (144), 88 states have internal predecessors, (144), 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 50 [2024-11-28 05:37:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:37:29,993 INFO L225 Difference]: With dead ends: 183 [2024-11-28 05:37:29,993 INFO L226 Difference]: Without dead ends: 153 [2024-11-28 05:37:29,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2103 ImplicationChecksByTransitivity, 379.0s TimeCoverageRelationStatistics Valid=551, Invalid=12266, Unknown=73, NotChecked=450, Total=13340 [2024-11-28 05:37:29,997 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 80 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 3532 mSolverCounterSat, 6 mSolverCounterUnsat, 57 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 268.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 3763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3532 IncrementalHoareTripleChecker+Invalid, 57 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 270.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:37:29,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 2693 Invalid, 3763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3532 Invalid, 57 Unknown, 168 Unchecked, 270.0s Time] [2024-11-28 05:37:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-28 05:37:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-11-28 05:37:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 150 states have internal predecessors, (170), 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 05:37:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 170 transitions. [2024-11-28 05:37:30,002 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 170 transitions. Word has length 50 [2024-11-28 05:37:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:37:30,002 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 170 transitions. [2024-11-28 05:37:30,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 87 states have (on average 1.6551724137931034) internal successors, (144), 88 states have internal predecessors, (144), 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 05:37:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 170 transitions. [2024-11-28 05:37:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 05:37:30,003 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:37:30,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:37:30,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 05:37:30,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-28 05:37:30,204 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:37:30,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:37:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash 391603176, now seen corresponding path program 1 times [2024-11-28 05:37:30,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:37:30,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535075889] [2024-11-28 05:37:30,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:37:30,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:37:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:37:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:37:34,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:37:34,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535075889] [2024-11-28 05:37:34,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535075889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:37:34,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279859813] [2024-11-28 05:37:34,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:37:34,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:37:34,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:37:34,472 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:37:34,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:37:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:37:34,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-28 05:37:34,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:37:34,821 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 15 treesize of output 1 [2024-11-28 05:37:34,828 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 05:37:34,928 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 05:37:34,938 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 8 treesize of output 1 [2024-11-28 05:37:36,766 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2024-11-28 05:37:36,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-28 05:37:37,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 23 [2024-11-28 05:37:37,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:37:37,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-11-28 05:37:37,894 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 69 treesize of output 35 [2024-11-28 05:37:37,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-28 05:37:38,430 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 31 treesize of output 13 [2024-11-28 05:37:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:37:38,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:37:39,926 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2373 Int) (v_ArrVal_2372 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sl_random_insert_~new~0#1.base| v_ArrVal_2372))) (store .cse0 |c_ULTIMATE.start_sl_random_insert_~a1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sl_random_insert_~a1~0#1.base|) |c_ULTIMATE.start_sl_random_insert_~a1~0#1.offset| v_ArrVal_2373))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~sl~1#1.base|) |c_ULTIMATE.start_main_~sl~1#1.offset|)) (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~sl~1#1.base|) |c_ULTIMATE.start_main_~sl~1#1.offset|)))) 1)) is different from false [2024-11-28 05:37:41,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:37:41,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:37:41,554 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 292 [2024-11-28 05:37:41,573 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 59 treesize of output 51 [2024-11-28 05:37:41,677 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 16 treesize of output 8 [2024-11-28 05:37:41,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:37:41,732 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 218 treesize of output 202 [2024-11-28 05:37:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:37:49,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279859813] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:37:49,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:37:49,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22, 22] total 73 [2024-11-28 05:37:49,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92135655] [2024-11-28 05:37:49,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:37:49,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-28 05:37:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:37:49,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-28 05:37:49,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=4921, Unknown=2, NotChecked=142, Total=5402 [2024-11-28 05:37:49,578 INFO L87 Difference]: Start difference. First operand 151 states and 170 transitions. Second operand has 74 states, 73 states have (on average 2.1780821917808217) internal successors, (159), 74 states have internal predecessors, (159), 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 05:38:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:38:04,379 INFO L93 Difference]: Finished difference Result 363 states and 416 transitions. [2024-11-28 05:38:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-28 05:38:04,380 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 2.1780821917808217) internal successors, (159), 74 states have internal predecessors, (159), 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 55 [2024-11-28 05:38:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:38:04,381 INFO L225 Difference]: With dead ends: 363 [2024-11-28 05:38:04,381 INFO L226 Difference]: Without dead ends: 363 [2024-11-28 05:38:04,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4111 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=1403, Invalid=12641, Unknown=2, NotChecked=234, Total=14280 [2024-11-28 05:38:04,382 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 1163 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 353 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:38:04,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1999 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2522 Invalid, 0 Unknown, 353 Unchecked, 5.9s Time] [2024-11-28 05:38:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-28 05:38:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 179. [2024-11-28 05:38:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 178 states have internal predecessors, (205), 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 05:38:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2024-11-28 05:38:04,389 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 55 [2024-11-28 05:38:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:38:04,389 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2024-11-28 05:38:04,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 2.1780821917808217) internal successors, (159), 74 states have internal predecessors, (159), 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 05:38:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2024-11-28 05:38:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 05:38:04,390 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:38:04,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:38:04,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 05:38:04,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-28 05:38:04,591 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:38:04,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:38:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash 391603177, now seen corresponding path program 1 times [2024-11-28 05:38:04,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:38:04,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139411462] [2024-11-28 05:38:04,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:38:04,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:38:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:38:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:38:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:38:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139411462] [2024-11-28 05:38:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139411462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:38:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753382258] [2024-11-28 05:38:09,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:38:09,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:38:09,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:38:09,380 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:38:09,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:38:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:38:09,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-28 05:38:09,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:38:09,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:38:09,774 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 05:38:09,782 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 05:38:11,990 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-28 05:38:11,990 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 15 treesize of output 15 [2024-11-28 05:38:12,204 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 28 treesize of output 23 [2024-11-28 05:38:12,210 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 22 treesize of output 17 [2024-11-28 05:38:12,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:38:12,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-11-28 05:38:12,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:38:12,426 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 45 treesize of output 21 [2024-11-28 05:38:13,162 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:38:13,163 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2024-11-28 05:38:13,351 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 43 treesize of output 23 [2024-11-28 05:38:13,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:38:13,364 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 16 [2024-11-28 05:38:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:38:13,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:38:21,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:38:21,319 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 356 treesize of output 350 [2024-11-28 05:38:21,330 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 379 treesize of output 347 [2024-11-28 05:38:21,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:38:21,361 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 764 treesize of output 748 [2024-11-28 05:38:21,377 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 631 treesize of output 599 [2024-11-28 05:38:22,689 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 17 treesize of output 9 [2024-11-28 05:38:22,702 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 17 treesize of output 9 [2024-11-28 05:38:22,953 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 17 treesize of output 9 [2024-11-28 05:38:22,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:38:22,987 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 426 treesize of output 402 [2024-11-28 05:38:23,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:38:23,535 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 432 treesize of output 392 [2024-11-28 05:38:26,749 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-28 05:38:26,749 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 17 treesize of output 16 [2024-11-28 05:38:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:38:26,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753382258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:38:26,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:38:26,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 23] total 76 [2024-11-28 05:38:26,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741446358] [2024-11-28 05:38:26,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:38:26,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-28 05:38:26,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:38:26,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-28 05:38:26,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=5369, Unknown=23, NotChecked=0, Total=5700 [2024-11-28 05:38:26,924 INFO L87 Difference]: Start difference. First operand 179 states and 205 transitions. Second operand has 76 states, 76 states have (on average 2.013157894736842) internal successors, (153), 76 states have internal predecessors, (153), 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 05:38:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:38:36,785 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2024-11-28 05:38:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-28 05:38:36,786 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 2.013157894736842) internal successors, (153), 76 states have internal predecessors, (153), 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 55 [2024-11-28 05:38:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:38:36,787 INFO L225 Difference]: With dead ends: 246 [2024-11-28 05:38:36,787 INFO L226 Difference]: Without dead ends: 246 [2024-11-28 05:38:36,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2561 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=920, Invalid=10399, Unknown=23, NotChecked=0, Total=11342 [2024-11-28 05:38:36,789 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 796 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:38:36,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1827 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-28 05:38:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-28 05:38:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 177. [2024-11-28 05:38:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 160 states have (on average 1.25) internal successors, (200), 176 states have internal predecessors, (200), 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 05:38:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 200 transitions. [2024-11-28 05:38:36,794 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 200 transitions. Word has length 55 [2024-11-28 05:38:36,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:38:36,794 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 200 transitions. [2024-11-28 05:38:36,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 2.013157894736842) internal successors, (153), 76 states have internal predecessors, (153), 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 05:38:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 200 transitions. [2024-11-28 05:38:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 05:38:36,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:38:36,795 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:38:36,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:38:36,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-28 05:38:36,996 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-28 05:38:36,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:38:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -195896032, now seen corresponding path program 1 times [2024-11-28 05:38:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:38:36,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853068811] [2024-11-28 05:38:36,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:38:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:38:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:38:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:38:43,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:38:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853068811] [2024-11-28 05:38:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853068811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:38:43,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047740202] [2024-11-28 05:38:43,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:38:43,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:38:43,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:38:43,467 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:38:43,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281222bf-d8d7-489c-a7e8-9919d12d8b9b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:38:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:38:43,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-28 05:38:43,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:38:44,281 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 05:38:44,530 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 39 treesize of output 1 [2024-11-28 05:38:44,780 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 27 treesize of output 19 [2024-11-28 05:38:44,789 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 23 treesize of output 15 [2024-11-28 05:38:45,061 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 21 treesize of output 9 [2024-11-28 05:38:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:38:45,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:38:45,125 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 58 treesize of output 44