./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test23-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test23-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU --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 6107b0424f9f7d96b4a493f3ee8e42c81c6509c50d1ec834cc7d1fa0b8a2c5d3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:07:08,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:07:08,206 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:07:08,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:07:08,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:07:08,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:07:08,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:07:08,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:07:08,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:07:08,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:07:08,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:07:08,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:07:08,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:07:08,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:07:08,261 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:07:08,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:07:08,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:07:08,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:07:08,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:07:08,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:07:08,265 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:07:08,268 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:07:08,269 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:07:08,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:07:08,271 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:07:08,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:07:08,272 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:07:08,274 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:07:08,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:07:08,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:07:08,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:07:08,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:07:08,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:07:08,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:08,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:07:08,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:07:08,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:07:08,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:07:08,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:07:08,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:07:08,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:07:08,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:07:08,281 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 6107b0424f9f7d96b4a493f3ee8e42c81c6509c50d1ec834cc7d1fa0b8a2c5d3 [2024-10-31 22:07:08,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:07:08,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:07:08,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:07:08,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:07:08,630 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:07:08,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/ldv-regression/test23-2.c Unable to find full path for "g++" [2024-10-31 22:07:10,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:07:11,191 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:07:11,192 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/sv-benchmarks/c/ldv-regression/test23-2.c [2024-10-31 22:07:11,203 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/data/1858e02fd/5020884ed834436cbe4db6a4344f252e/FLAGd82a2fb65 [2024-10-31 22:07:11,225 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/data/1858e02fd/5020884ed834436cbe4db6a4344f252e [2024-10-31 22:07:11,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:07:11,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:07:11,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:07:11,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:07:11,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:07:11,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6863fa35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11, skipping insertion in model container [2024-10-31 22:07:11,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:07:11,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:07:11,526 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:07:11,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:07:11,572 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:07:11,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11 WrapperNode [2024-10-31 22:07:11,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:07:11,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:07:11,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:07:11,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:07:11,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,628 INFO L138 Inliner]: procedures = 16, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2024-10-31 22:07:11,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:07:11,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:07:11,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:07:11,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:07:11,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,662 INFO L175 MemorySlicer]: Split 46 memory accesses to 2 slices as follows [2, 44]. 96 percent of accesses are in the largest equivalence class. The 38 initializations are split as follows [2, 36]. The 5 writes are split as follows [0, 5]. [2024-10-31 22:07:11,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:07:11,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:07:11,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:07:11,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:07:11,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (1/1) ... [2024-10-31 22:07:11,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:11,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:07:11,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:07:11,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:07:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:07:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:07:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:07:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:07:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:07:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2024-10-31 22:07:11,763 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2024-10-31 22:07:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:07:11,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:07:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:07:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:07:11,864 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:07:11,869 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:07:12,205 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-10-31 22:07:12,205 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:07:12,221 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:07:12,222 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:07:12,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:07:12 BoogieIcfgContainer [2024-10-31 22:07:12,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:07:12,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:07:12,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:07:12,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:07:12,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:07:11" (1/3) ... [2024-10-31 22:07:12,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ce3789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:07:12, skipping insertion in model container [2024-10-31 22:07:12,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:11" (2/3) ... [2024-10-31 22:07:12,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ce3789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:07:12, skipping insertion in model container [2024-10-31 22:07:12,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:07:12" (3/3) ... [2024-10-31 22:07:12,232 INFO L112 eAbstractionObserver]: Analyzing ICFG test23-2.c [2024-10-31 22:07:12,253 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:07:12,253 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-10-31 22:07:12,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:07:12,308 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;@6733971b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:07:12,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-10-31 22:07:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-31 22:07:12,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:12,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-31 22:07:12,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:12,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash 31843, now seen corresponding path program 1 times [2024-10-31 22:07:12,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:12,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696931853] [2024-10-31 22:07:12,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:12,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696931853] [2024-10-31 22:07:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696931853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:12,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:12,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:07:12,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597715082] [2024-10-31 22:07:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:12,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:12,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:12,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:12,742 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-31 22:07:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:12,835 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2024-10-31 22:07:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:12,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-31 22:07:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:12,846 INFO L225 Difference]: With dead ends: 52 [2024-10-31 22:07:12,846 INFO L226 Difference]: Without dead ends: 50 [2024-10-31 22:07:12,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-31 22:07:12,855 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:12,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:07:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-31 22:07:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-31 22:07:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-10-31 22:07:12,907 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 3 [2024-10-31 22:07:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:12,908 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-10-31 22:07:12,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-31 22:07:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2024-10-31 22:07:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-31 22:07:12,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:12,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-31 22:07:12,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:07:12,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:12,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash 31844, now seen corresponding path program 1 times [2024-10-31 22:07:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133271974] [2024-10-31 22:07:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:12,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:13,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:13,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133271974] [2024-10-31 22:07:13,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133271974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:13,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:13,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:07:13,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926466749] [2024-10-31 22:07:13,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:13,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:13,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:13,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:13,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:13,101 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-31 22:07:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:13,142 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-10-31 22:07:13,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:13,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-31 22:07:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:13,144 INFO L225 Difference]: With dead ends: 48 [2024-10-31 22:07:13,144 INFO L226 Difference]: Without dead ends: 48 [2024-10-31 22:07:13,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-31 22:07:13,146 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:13,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:07:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-31 22:07:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-31 22:07:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-10-31 22:07:13,158 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 3 [2024-10-31 22:07:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:13,158 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-10-31 22:07:13,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-31 22:07:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-10-31 22:07:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 22:07:13,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:13,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:13,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:07:13,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:13,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -657768027, now seen corresponding path program 1 times [2024-10-31 22:07:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:13,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712107778] [2024-10-31 22:07:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:13,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:13,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712107778] [2024-10-31 22:07:13,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712107778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:13,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:13,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:07:13,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291194932] [2024-10-31 22:07:13,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:13,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:13,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:13,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:13,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:13,279 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:13,332 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-10-31 22:07:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-31 22:07:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:13,334 INFO L225 Difference]: With dead ends: 46 [2024-10-31 22:07:13,334 INFO L226 Difference]: Without dead ends: 46 [2024-10-31 22:07:13,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-31 22:07:13,336 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:13,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:07:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-31 22:07:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-31 22:07:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2024-10-31 22:07:13,343 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 7 [2024-10-31 22:07:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:13,343 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2024-10-31 22:07:13,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2024-10-31 22:07:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 22:07:13,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:13,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:13,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:07:13,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:13,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:13,346 INFO L85 PathProgramCache]: Analyzing trace with hash -657768026, now seen corresponding path program 1 times [2024-10-31 22:07:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442710164] [2024-10-31 22:07:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:13,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:13,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:13,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442710164] [2024-10-31 22:07:13,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442710164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:13,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:13,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:07:13,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214192088] [2024-10-31 22:07:13,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:13,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:13,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:13,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:13,477 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:13,507 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2024-10-31 22:07:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:13,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-31 22:07:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:13,509 INFO L225 Difference]: With dead ends: 44 [2024-10-31 22:07:13,509 INFO L226 Difference]: Without dead ends: 44 [2024-10-31 22:07:13,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-31 22:07:13,510 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:13,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:07:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-31 22:07:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-31 22:07:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-10-31 22:07:13,516 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 7 [2024-10-31 22:07:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:13,516 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-10-31 22:07:13,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-10-31 22:07:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:07:13,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:13,518 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:13,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:07:13,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:13,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:13,519 INFO L85 PathProgramCache]: Analyzing trace with hash 166237900, now seen corresponding path program 1 times [2024-10-31 22:07:13,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:13,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051809834] [2024-10-31 22:07:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:13,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:14,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:14,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:07:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:07:14,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:14,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051809834] [2024-10-31 22:07:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051809834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:14,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:14,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:07:14,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779728957] [2024-10-31 22:07:14,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:14,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:07:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:14,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:07:14,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:07:14,325 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:14,658 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-10-31 22:07:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:07:14,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-31 22:07:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:14,661 INFO L225 Difference]: With dead ends: 42 [2024-10-31 22:07:14,663 INFO L226 Difference]: Without dead ends: 42 [2024-10-31 22:07:14,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:07:14,665 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:14,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 99 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:07:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-31 22:07:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-31 22:07:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-10-31 22:07:14,673 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 23 [2024-10-31 22:07:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:14,678 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-10-31 22:07:14,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-10-31 22:07:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:07:14,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:14,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:14,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:07:14,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:14,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash 166237899, now seen corresponding path program 1 times [2024-10-31 22:07:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:14,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737260787] [2024-10-31 22:07:14,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:14,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:07:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:07:14,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737260787] [2024-10-31 22:07:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737260787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:14,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:14,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:07:14,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592200721] [2024-10-31 22:07:14,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:14,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:07:14,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:07:14,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:07:14,937 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:15,069 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-10-31 22:07:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:15,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-31 22:07:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:15,073 INFO L225 Difference]: With dead ends: 40 [2024-10-31 22:07:15,074 INFO L226 Difference]: Without dead ends: 40 [2024-10-31 22:07:15,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:07:15,075 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:15,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 79 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:07:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-31 22:07:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-31 22:07:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-10-31 22:07:15,110 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 23 [2024-10-31 22:07:15,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:15,111 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-10-31 22:07:15,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-10-31 22:07:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:07:15,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:15,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:15,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:07:15,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:15,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash 858444353, now seen corresponding path program 1 times [2024-10-31 22:07:15,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:15,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754438205] [2024-10-31 22:07:15,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:15,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:07:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:07:15,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:15,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754438205] [2024-10-31 22:07:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754438205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:15,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:15,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596368940] [2024-10-31 22:07:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:15,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:15,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:15,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:15,230 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:15,258 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-10-31 22:07:15,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:15,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-31 22:07:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:15,259 INFO L225 Difference]: With dead ends: 39 [2024-10-31 22:07:15,260 INFO L226 Difference]: Without dead ends: 37 [2024-10-31 22:07:15,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-31 22:07:15,261 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:15,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:07:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-31 22:07:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-31 22:07:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-10-31 22:07:15,266 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 24 [2024-10-31 22:07:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:15,266 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-10-31 22:07:15,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-10-31 22:07:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:07:15,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:15,268 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:07:15,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:07:15,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:15,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash 584820305, now seen corresponding path program 1 times [2024-10-31 22:07:15,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:15,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324011526] [2024-10-31 22:07:15,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:15,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:07:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:07:15,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:15,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324011526] [2024-10-31 22:07:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324011526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:15,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:15,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:07:15,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690200185] [2024-10-31 22:07:15,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:15,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:07:15,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:15,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:07:15,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:15,452 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:15,516 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-31 22:07:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-31 22:07:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:15,517 INFO L225 Difference]: With dead ends: 36 [2024-10-31 22:07:15,517 INFO L226 Difference]: Without dead ends: 36 [2024-10-31 22:07:15,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:15,518 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:15,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:07:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-31 22:07:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-31 22:07:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-10-31 22:07:15,528 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 27 [2024-10-31 22:07:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:15,529 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-10-31 22:07:15,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-10-31 22:07:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:07:15,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:15,530 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:07:15,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:07:15,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:15,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash 584820306, now seen corresponding path program 1 times [2024-10-31 22:07:15,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:15,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077812890] [2024-10-31 22:07:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:15,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:07:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:07:15,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077812890] [2024-10-31 22:07:15,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077812890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:15,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:15,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:07:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944911256] [2024-10-31 22:07:15,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:15,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:07:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:15,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:07:15,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:15,777 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:15,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:15,850 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-10-31 22:07:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:15,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-31 22:07:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:15,852 INFO L225 Difference]: With dead ends: 35 [2024-10-31 22:07:15,852 INFO L226 Difference]: Without dead ends: 35 [2024-10-31 22:07:15,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:15,853 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:15,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 91 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:07:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-31 22:07:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-31 22:07:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-10-31 22:07:15,862 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 27 [2024-10-31 22:07:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:15,862 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-10-31 22:07:15,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-10-31 22:07:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-31 22:07:15,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:15,864 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:07:15,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:07:15,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:15,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1994370753, now seen corresponding path program 1 times [2024-10-31 22:07:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123666303] [2024-10-31 22:07:15,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:07:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:07:15,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:15,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123666303] [2024-10-31 22:07:15,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123666303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:15,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:15,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:07:15,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383333189] [2024-10-31 22:07:15,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:15,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:07:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:15,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:07:15,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:07:15,999 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:16,049 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-10-31 22:07:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:07:16,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-31 22:07:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:16,051 INFO L225 Difference]: With dead ends: 34 [2024-10-31 22:07:16,051 INFO L226 Difference]: Without dead ends: 34 [2024-10-31 22:07:16,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:07:16,053 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:16,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:07:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-31 22:07:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-31 22:07:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-31 22:07:16,060 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2024-10-31 22:07:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:16,061 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-31 22:07:16,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-10-31 22:07:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-31 22:07:16,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:16,065 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:07:16,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:07:16,065 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1994370754, now seen corresponding path program 1 times [2024-10-31 22:07:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193479303] [2024-10-31 22:07:16,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:07:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:07:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193479303] [2024-10-31 22:07:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193479303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:18,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 22:07:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931365988] [2024-10-31 22:07:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:18,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-31 22:07:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:18,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-31 22:07:18,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:07:18,436 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:18,926 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-10-31 22:07:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:07:18,927 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-31 22:07:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:18,928 INFO L225 Difference]: With dead ends: 38 [2024-10-31 22:07:18,928 INFO L226 Difference]: Without dead ends: 38 [2024-10-31 22:07:18,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2024-10-31 22:07:18,931 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:18,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 177 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:07:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-31 22:07:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-31 22:07:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2024-10-31 22:07:18,937 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2024-10-31 22:07:18,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:18,938 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2024-10-31 22:07:18,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-31 22:07:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-10-31 22:07:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:07:18,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:18,939 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-31 22:07:18,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:07:18,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:18,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1036392969, now seen corresponding path program 1 times [2024-10-31 22:07:18,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:18,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574734728] [2024-10-31 22:07:18,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:21,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:07:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:07:21,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:21,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574734728] [2024-10-31 22:07:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574734728] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:07:21,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836574245] [2024-10-31 22:07:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:21,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:07:21,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:07:21,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:07:21,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:07:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:21,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-31 22:07:21,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:07:22,077 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 16 treesize of output 12 [2024-10-31 22:07:22,539 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2024-10-31 22:07:22,539 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 25 [2024-10-31 22:07:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:07:22,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:07:22,949 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 32 treesize of output 23 [2024-10-31 22:07:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:07:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836574245] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:07:22,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:07:22,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2024-10-31 22:07:22,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40734506] [2024-10-31 22:07:22,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:07:22,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-31 22:07:22,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:22,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-31 22:07:22,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2024-10-31 22:07:22,978 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-31 22:07:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:24,416 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-10-31 22:07:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-31 22:07:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-31 22:07:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:24,418 INFO L225 Difference]: With dead ends: 42 [2024-10-31 22:07:24,418 INFO L226 Difference]: Without dead ends: 42 [2024-10-31 22:07:24,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=1777, Unknown=0, NotChecked=0, Total=1980 [2024-10-31 22:07:24,420 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:24,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 354 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:07:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-31 22:07:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-31 22:07:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-10-31 22:07:24,423 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 32 [2024-10-31 22:07:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:24,424 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-10-31 22:07:24,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-31 22:07:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-10-31 22:07:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-31 22:07:24,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:24,425 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 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-10-31 22:07:24,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:07:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:07:24,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 426039646, now seen corresponding path program 2 times [2024-10-31 22:07:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359461795] [2024-10-31 22:07:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:07:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:07:26,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359461795] [2024-10-31 22:07:26,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359461795] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:07:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954374886] [2024-10-31 22:07:26,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:07:26,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:07:26,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:07:26,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:07:26,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:07:26,645 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:07:26,645 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:07:26,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-31 22:07:26,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:07:26,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 16 treesize of output 12 [2024-10-31 22:07:27,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:07:27,107 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 27 treesize of output 12 [2024-10-31 22:07:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:07:27,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:07:27,552 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 32 treesize of output 23 [2024-10-31 22:07:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:07:27,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954374886] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:07:27,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:07:27,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 38 [2024-10-31 22:07:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377502104] [2024-10-31 22:07:27,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:07:27,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-31 22:07:27,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-31 22:07:27,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1262, Unknown=0, NotChecked=0, Total=1406 [2024-10-31 22:07:27,571 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-31 22:07:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:29,755 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2024-10-31 22:07:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-31 22:07:29,756 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-10-31 22:07:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:29,757 INFO L225 Difference]: With dead ends: 54 [2024-10-31 22:07:29,757 INFO L226 Difference]: Without dead ends: 54 [2024-10-31 22:07:29,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=597, Invalid=3563, Unknown=0, NotChecked=0, Total=4160 [2024-10-31 22:07:29,759 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 62 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:29,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 277 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:07:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-31 22:07:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-31 22:07:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2024-10-31 22:07:29,763 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 38 [2024-10-31 22:07:29,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:29,764 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2024-10-31 22:07:29,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-31 22:07:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2024-10-31 22:07:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-31 22:07:29,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:29,765 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 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-10-31 22:07:29,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-31 22:07:29,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:07:29,970 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:29,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash -282891064, now seen corresponding path program 3 times [2024-10-31 22:07:29,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:29,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529647274] [2024-10-31 22:07:29,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:29,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:30,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:30,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:07:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:07:30,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529647274] [2024-10-31 22:07:30,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529647274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:07:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271008198] [2024-10-31 22:07:30,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-31 22:07:30,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:07:30,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:07:30,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:07:30,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 22:07:31,109 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-31 22:07:31,110 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:07:31,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-31 22:07:31,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:07:31,286 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 16 treesize of output 12 [2024-10-31 22:07:31,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:07:31,997 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 111 treesize of output 80 [2024-10-31 22:07:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-31 22:07:32,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:07:32,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:07:32,881 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 27 treesize of output 31 [2024-10-31 22:07:33,478 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 88 treesize of output 70 [2024-10-31 22:07:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:07:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271008198] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:07:33,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:07:33,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 9] total 31 [2024-10-31 22:07:33,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505212581] [2024-10-31 22:07:33,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:07:33,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-31 22:07:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:33,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-31 22:07:33,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2024-10-31 22:07:33,514 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-31 22:07:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:36,573 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2024-10-31 22:07:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-31 22:07:36,576 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-10-31 22:07:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:36,577 INFO L225 Difference]: With dead ends: 55 [2024-10-31 22:07:36,577 INFO L226 Difference]: Without dead ends: 55 [2024-10-31 22:07:36,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=401, Invalid=3259, Unknown=0, NotChecked=0, Total=3660 [2024-10-31 22:07:36,579 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 71 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:36,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 409 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:07:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-31 22:07:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-10-31 22:07:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 22:07:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2024-10-31 22:07:36,586 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2024-10-31 22:07:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:36,587 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2024-10-31 22:07:36,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-31 22:07:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-10-31 22:07:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-31 22:07:36,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:36,588 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 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] [2024-10-31 22:07:36,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-31 22:07:36,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03960a80-6c7e-4246-9a1e-8d73eb25a6b7/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:07:36,789 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-31 22:07:36,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1354850793, now seen corresponding path program 1 times [2024-10-31 22:07:36,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:36,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359331768] [2024-10-31 22:07:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:36,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat