./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0217.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/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_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0217.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/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_4a254292-59a6-4f36-818d-18656089f6b8/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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:56:47,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:56:47,310 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 21:56:47,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:56:47,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:56:47,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:56:47,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:56:47,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:56:47,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:56:47,359 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:56:47,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:56:47,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:56:47,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:56:47,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:56:47,367 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:56:47,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:56:47,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:56:47,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:56:47,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:56:47,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:56:47,369 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 21:56:47,374 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 21:56:47,374 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 21:56:47,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:56:47,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:56:47,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:56:47,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:56:47,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:56:47,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:56:47,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:56:47,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:56:47,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:56:47,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:56:47,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:56:47,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:56:47,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:56:47,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:56:47,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:56:47,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:56:47,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:56:47,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:56:47,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:56:47,384 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_4a254292-59a6-4f36-818d-18656089f6b8/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_4a254292-59a6-4f36-818d-18656089f6b8/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 -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2024-10-31 21:56:47,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:56:47,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:56:47,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:56:47,738 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:56:47,739 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:56:47,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/memsafety/test-0217.i Unable to find full path for "g++" [2024-10-31 21:56:50,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:56:50,432 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:56:50,433 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/sv-benchmarks/c/memsafety/test-0217.i [2024-10-31 21:56:50,450 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/data/11dd832f8/bb9b7a73864f452e838761503a8dc255/FLAG2dfce729e [2024-10-31 21:56:50,683 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/data/11dd832f8/bb9b7a73864f452e838761503a8dc255 [2024-10-31 21:56:50,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:56:50,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:56:50,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:50,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:56:50,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:56:50,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:50" (1/1) ... [2024-10-31 21:56:50,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b9bdba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:50, skipping insertion in model container [2024-10-31 21:56:50,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:50" (1/1) ... [2024-10-31 21:56:50,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:56:51,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:51,376 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:56:51,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:51,509 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:56:51,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51 WrapperNode [2024-10-31 21:56:51,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:51,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:51,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:56:51,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:56:51,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,598 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 213 [2024-10-31 21:56:51,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:51,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:56:51,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:56:51,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:56:51,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,652 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 11 writes are split as follows [0, 11]. [2024-10-31 21:56:51,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:56:51,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:56:51,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:56:51,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:56:51,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (1/1) ... [2024-10-31 21:56:51,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:56:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:56:51,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:56:51,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:56:51,763 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-10-31 21:56:51,764 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-10-31 21:56:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 21:56:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 21:56:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 21:56:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:56:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 21:56:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 21:56:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 21:56:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 21:56:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 21:56:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-31 21:56:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-31 21:56:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:56:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 21:56:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:56:51,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:56:51,967 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:56:51,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:56:52,658 INFO L? ?]: Removed 187 outVars from TransFormulas that were not future-live. [2024-10-31 21:56:52,658 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:56:52,681 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:56:52,681 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-31 21:56:52,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:52 BoogieIcfgContainer [2024-10-31 21:56:52,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:56:52,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:56:52,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:56:52,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:56:52,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:56:50" (1/3) ... [2024-10-31 21:56:52,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cb4425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:56:52, skipping insertion in model container [2024-10-31 21:56:52,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:51" (2/3) ... [2024-10-31 21:56:52,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cb4425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:56:52, skipping insertion in model container [2024-10-31 21:56:52,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:52" (3/3) ... [2024-10-31 21:56:52,695 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0217.i [2024-10-31 21:56:52,712 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:56:52,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-10-31 21:56:52,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:56:52,780 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;@1fd0aec5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:56:52,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-10-31 21:56:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 163 states have internal predecessors, (188), 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 21:56:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-31 21:56:52,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:52,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 21:56:52,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:52,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1074518762, now seen corresponding path program 1 times [2024-10-31 21:56:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859505134] [2024-10-31 21:56:52,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:52,953 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 21:56:52,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859505134] [2024-10-31 21:56:52,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859505134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:52,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:52,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:56:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041925320] [2024-10-31 21:56:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:52,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:56:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:52,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:56:52,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:56:53,000 INFO L87 Difference]: Start difference. First operand has 167 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 163 states have internal predecessors, (188), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 21:56:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:53,027 INFO L93 Difference]: Finished difference Result 167 states and 186 transitions. [2024-10-31 21:56:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:56:53,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-31 21:56:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:53,039 INFO L225 Difference]: With dead ends: 167 [2024-10-31 21:56:53,039 INFO L226 Difference]: Without dead ends: 165 [2024-10-31 21:56:53,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:56:53,047 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:53,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:56:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-31 21:56:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-10-31 21:56:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 95 states have (on average 1.894736842105263) internal successors, (180), 161 states have internal predecessors, (180), 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 21:56:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 184 transitions. [2024-10-31 21:56:53,115 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 184 transitions. Word has length 6 [2024-10-31 21:56:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:53,116 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 184 transitions. [2024-10-31 21:56:53,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 21:56:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 184 transitions. [2024-10-31 21:56:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 21:56:53,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:53,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:53,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:56:53,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:53,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:53,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1280331232, now seen corresponding path program 1 times [2024-10-31 21:56:53,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:53,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729274702] [2024-10-31 21:56:53,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:53,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:53,291 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 21:56:53,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:53,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729274702] [2024-10-31 21:56:53,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729274702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:53,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:53,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 21:56:53,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400171196] [2024-10-31 21:56:53,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:53,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:56:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:56:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:56:53,295 INFO L87 Difference]: Start difference. First operand 165 states and 184 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 21:56:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:53,632 INFO L93 Difference]: Finished difference Result 321 states and 358 transitions. [2024-10-31 21:56:53,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:56:53,633 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 21:56:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:53,636 INFO L225 Difference]: With dead ends: 321 [2024-10-31 21:56:53,640 INFO L226 Difference]: Without dead ends: 321 [2024-10-31 21:56:53,640 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 21:56:53,641 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 165 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:53,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 235 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:56:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-31 21:56:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 229. [2024-10-31 21:56:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 156 states have (on average 1.8717948717948718) internal successors, (292), 222 states have internal predecessors, (292), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-31 21:56:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2024-10-31 21:56:53,686 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 7 [2024-10-31 21:56:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:53,686 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2024-10-31 21:56:53,687 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 21:56:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2024-10-31 21:56:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 21:56:53,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:53,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:53,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:56:53,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:53,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1280331231, now seen corresponding path program 1 times [2024-10-31 21:56:53,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:53,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74295253] [2024-10-31 21:56:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:53,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74295253] [2024-10-31 21:56:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74295253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:53,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:56:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176384064] [2024-10-31 21:56:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:53,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:56:53,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:56:53,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:56:53,975 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 21:56:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:54,212 INFO L93 Difference]: Finished difference Result 353 states and 447 transitions. [2024-10-31 21:56:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:56:54,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 21:56:54,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:54,217 INFO L225 Difference]: With dead ends: 353 [2024-10-31 21:56:54,217 INFO L226 Difference]: Without dead ends: 353 [2024-10-31 21:56:54,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:56:54,219 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 103 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:54,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 353 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:56:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-31 21:56:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 302. [2024-10-31 21:56:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 223 states have (on average 1.8340807174887892) internal successors, (409), 291 states have internal predecessors, (409), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-31 21:56:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2024-10-31 21:56:54,284 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 7 [2024-10-31 21:56:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:54,285 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2024-10-31 21:56:54,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 21:56:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2024-10-31 21:56:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 21:56:54,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:54,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:54,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:56:54,288 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:54,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1280331169, now seen corresponding path program 1 times [2024-10-31 21:56:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622804049] [2024-10-31 21:56:54,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:54,464 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 21:56:54,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:54,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622804049] [2024-10-31 21:56:54,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622804049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:54,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:54,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:56:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811076410] [2024-10-31 21:56:54,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:54,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:56:54,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:54,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:56:54,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:56:54,466 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 21:56:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:54,682 INFO L93 Difference]: Finished difference Result 352 states and 445 transitions. [2024-10-31 21:56:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:56:54,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 21:56:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:54,684 INFO L225 Difference]: With dead ends: 352 [2024-10-31 21:56:54,685 INFO L226 Difference]: Without dead ends: 352 [2024-10-31 21:56:54,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:56:54,688 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 100 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:54,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 354 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:56:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-31 21:56:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 302. [2024-10-31 21:56:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 223 states have (on average 1.8340807174887892) internal successors, (409), 291 states have internal predecessors, (409), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-31 21:56:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2024-10-31 21:56:54,729 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 7 [2024-10-31 21:56:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:54,729 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2024-10-31 21:56:54,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 21:56:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2024-10-31 21:56:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-31 21:56:54,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:54,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:54,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:56:54,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:54,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1257058894, now seen corresponding path program 1 times [2024-10-31 21:56:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069971594] [2024-10-31 21:56:54,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:54,995 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 21:56:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069971594] [2024-10-31 21:56:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069971594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:54,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:54,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:56:54,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656048659] [2024-10-31 21:56:54,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:54,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:56:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:55,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:56:55,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:56:55,001 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:55,258 INFO L93 Difference]: Finished difference Result 446 states and 601 transitions. [2024-10-31 21:56:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:56:55,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-31 21:56:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:55,263 INFO L225 Difference]: With dead ends: 446 [2024-10-31 21:56:55,263 INFO L226 Difference]: Without dead ends: 446 [2024-10-31 21:56:55,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:56:55,266 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 131 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:55,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 727 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:56:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-31 21:56:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 344. [2024-10-31 21:56:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 262 states have (on average 1.816793893129771) internal successors, (476), 331 states have internal predecessors, (476), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:56:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 496 transitions. [2024-10-31 21:56:55,298 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 496 transitions. Word has length 10 [2024-10-31 21:56:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:55,298 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 496 transitions. [2024-10-31 21:56:55,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 496 transitions. [2024-10-31 21:56:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-31 21:56:55,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:55,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:55,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:56:55,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:55,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:55,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1258905936, now seen corresponding path program 1 times [2024-10-31 21:56:55,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:55,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830641816] [2024-10-31 21:56:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:55,468 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 21:56:55,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:55,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830641816] [2024-10-31 21:56:55,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830641816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:55,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:55,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:56:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677000124] [2024-10-31 21:56:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:55,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:56:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:55,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:56:55,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:56:55,471 INFO L87 Difference]: Start difference. First operand 344 states and 496 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:55,787 INFO L93 Difference]: Finished difference Result 436 states and 590 transitions. [2024-10-31 21:56:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:56:55,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-31 21:56:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:55,790 INFO L225 Difference]: With dead ends: 436 [2024-10-31 21:56:55,791 INFO L226 Difference]: Without dead ends: 436 [2024-10-31 21:56:55,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:56:55,792 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 116 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:55,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 772 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:56:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-31 21:56:55,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 343. [2024-10-31 21:56:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 261 states have (on average 1.8199233716475096) internal successors, (475), 330 states have internal predecessors, (475), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:56:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 495 transitions. [2024-10-31 21:56:55,808 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 495 transitions. Word has length 10 [2024-10-31 21:56:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:55,808 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 495 transitions. [2024-10-31 21:56:55,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 495 transitions. [2024-10-31 21:56:55,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-31 21:56:55,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:55,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:55,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:56:55,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:55,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash 314118792, now seen corresponding path program 1 times [2024-10-31 21:56:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507476969] [2024-10-31 21:56:55,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:55,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:55,845 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 21:56:55,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:55,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507476969] [2024-10-31 21:56:55,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507476969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:55,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:55,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:56:55,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043756414] [2024-10-31 21:56:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:55,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:56:55,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:56:55,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:56:55,848 INFO L87 Difference]: Start difference. First operand 343 states and 495 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:56,036 INFO L93 Difference]: Finished difference Result 394 states and 542 transitions. [2024-10-31 21:56:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:56:56,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-31 21:56:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:56,039 INFO L225 Difference]: With dead ends: 394 [2024-10-31 21:56:56,039 INFO L226 Difference]: Without dead ends: 387 [2024-10-31 21:56:56,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:56:56,043 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:56,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 273 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:56:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-31 21:56:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 340. [2024-10-31 21:56:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 258 states have (on average 1.821705426356589) internal successors, (470), 327 states have internal predecessors, (470), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:56:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 490 transitions. [2024-10-31 21:56:56,059 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 490 transitions. Word has length 11 [2024-10-31 21:56:56,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:56,059 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 490 transitions. [2024-10-31 21:56:56,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 490 transitions. [2024-10-31 21:56:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-31 21:56:56,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:56,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:56,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:56:56,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:56,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -584855357, now seen corresponding path program 1 times [2024-10-31 21:56:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247117945] [2024-10-31 21:56:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:56,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:56,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:56:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:56,179 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 21:56:56,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:56,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247117945] [2024-10-31 21:56:56,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247117945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:56,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:56,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:56:56,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692064486] [2024-10-31 21:56:56,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:56,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:56:56,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:56,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:56:56,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:56:56,186 INFO L87 Difference]: Start difference. First operand 340 states and 490 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:56,542 INFO L93 Difference]: Finished difference Result 448 states and 585 transitions. [2024-10-31 21:56:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:56:56,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-31 21:56:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:56,546 INFO L225 Difference]: With dead ends: 448 [2024-10-31 21:56:56,547 INFO L226 Difference]: Without dead ends: 448 [2024-10-31 21:56:56,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:56:56,548 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 169 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:56,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 340 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:56:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-31 21:56:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 346. [2024-10-31 21:56:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 264 states have (on average 1.803030303030303) internal successors, (476), 333 states have internal predecessors, (476), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:56:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 496 transitions. [2024-10-31 21:56:56,570 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 496 transitions. Word has length 15 [2024-10-31 21:56:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:56,572 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 496 transitions. [2024-10-31 21:56:56,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 496 transitions. [2024-10-31 21:56:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-31 21:56:56,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:56,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:56,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:56:56,573 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:56,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:56,574 INFO L85 PathProgramCache]: Analyzing trace with hash -584855356, now seen corresponding path program 1 times [2024-10-31 21:56:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:56,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111718302] [2024-10-31 21:56:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:56,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:56:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:56,735 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 21:56:56,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:56,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111718302] [2024-10-31 21:56:56,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111718302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:56,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:56,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:56:56,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478392383] [2024-10-31 21:56:56,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:56,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:56:56,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:56,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:56:56,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:56:56,740 INFO L87 Difference]: Start difference. First operand 346 states and 496 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:57,069 INFO L93 Difference]: Finished difference Result 394 states and 508 transitions. [2024-10-31 21:56:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:56:57,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-31 21:56:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:57,072 INFO L225 Difference]: With dead ends: 394 [2024-10-31 21:56:57,073 INFO L226 Difference]: Without dead ends: 394 [2024-10-31 21:56:57,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:56:57,074 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 102 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:57,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 432 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:56:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-31 21:56:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 346. [2024-10-31 21:56:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 264 states have (on average 1.768939393939394) internal successors, (467), 333 states have internal predecessors, (467), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:56:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 487 transitions. [2024-10-31 21:56:57,093 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 487 transitions. Word has length 15 [2024-10-31 21:56:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:57,094 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 487 transitions. [2024-10-31 21:56:57,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 487 transitions. [2024-10-31 21:56:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-31 21:56:57,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:57,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:57,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:56:57,097 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:57,098 INFO L85 PathProgramCache]: Analyzing trace with hash 590215118, now seen corresponding path program 1 times [2024-10-31 21:56:57,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:57,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351966896] [2024-10-31 21:56:57,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:57,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:57,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:56:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:57,338 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 21:56:57,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:57,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351966896] [2024-10-31 21:56:57,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351966896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:57,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:57,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:56:57,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23350968] [2024-10-31 21:56:57,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:57,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:56:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:57,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:56:57,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:56:57,340 INFO L87 Difference]: Start difference. First operand 346 states and 487 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:57,775 INFO L93 Difference]: Finished difference Result 464 states and 606 transitions. [2024-10-31 21:56:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:56:57,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-31 21:56:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:57,778 INFO L225 Difference]: With dead ends: 464 [2024-10-31 21:56:57,779 INFO L226 Difference]: Without dead ends: 464 [2024-10-31 21:56:57,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:56:57,780 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 338 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:57,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 324 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 21:56:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-10-31 21:56:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 343. [2024-10-31 21:56:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 265 states have (on average 1.739622641509434) internal successors, (461), 330 states have internal predecessors, (461), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 21:56:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 481 transitions. [2024-10-31 21:56:57,799 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 481 transitions. Word has length 17 [2024-10-31 21:56:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:57,799 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 481 transitions. [2024-10-31 21:56:57,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 481 transitions. [2024-10-31 21:56:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-31 21:56:57,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:57,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:57,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:56:57,803 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:57,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:57,803 INFO L85 PathProgramCache]: Analyzing trace with hash 590215119, now seen corresponding path program 1 times [2024-10-31 21:56:57,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:57,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099043236] [2024-10-31 21:56:57,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:56:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:58,186 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 21:56:58,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:58,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099043236] [2024-10-31 21:56:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099043236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:58,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:58,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:56:58,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753172211] [2024-10-31 21:56:58,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:58,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:56:58,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:58,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:56:58,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:56:58,189 INFO L87 Difference]: Start difference. First operand 343 states and 481 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:58,992 INFO L93 Difference]: Finished difference Result 492 states and 633 transitions. [2024-10-31 21:56:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:56:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-31 21:56:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:58,997 INFO L225 Difference]: With dead ends: 492 [2024-10-31 21:56:58,997 INFO L226 Difference]: Without dead ends: 492 [2024-10-31 21:56:58,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-31 21:56:58,998 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 280 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:58,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 450 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 21:56:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-31 21:56:59,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 376. [2024-10-31 21:56:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 296 states have (on average 1.7263513513513513) internal successors, (511), 362 states have internal predecessors, (511), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-31 21:56:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 535 transitions. [2024-10-31 21:56:59,016 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 535 transitions. Word has length 17 [2024-10-31 21:56:59,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:59,016 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 535 transitions. [2024-10-31 21:56:59,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 535 transitions. [2024-10-31 21:56:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-31 21:56:59,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:59,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:59,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:56:59,019 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:59,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1217239344, now seen corresponding path program 1 times [2024-10-31 21:56:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:59,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112402039] [2024-10-31 21:56:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:59,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:56:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:59,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:59,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112402039] [2024-10-31 21:56:59,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112402039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:59,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:59,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:56:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740896686] [2024-10-31 21:56:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:59,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:56:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:59,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:56:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:56:59,137 INFO L87 Difference]: Start difference. First operand 376 states and 535 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:59,188 INFO L93 Difference]: Finished difference Result 386 states and 547 transitions. [2024-10-31 21:56:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:56:59,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-31 21:56:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:56:59,191 INFO L225 Difference]: With dead ends: 386 [2024-10-31 21:56:59,192 INFO L226 Difference]: Without dead ends: 386 [2024-10-31 21:56:59,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:56:59,193 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:56:59,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 901 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:56:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-31 21:56:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-10-31 21:56:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 303 states have (on average 1.7062706270627064) internal successors, (517), 371 states have internal predecessors, (517), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:56:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 547 transitions. [2024-10-31 21:56:59,211 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 547 transitions. Word has length 17 [2024-10-31 21:56:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:56:59,211 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 547 transitions. [2024-10-31 21:56:59,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 547 transitions. [2024-10-31 21:56:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 21:56:59,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:56:59,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:59,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:56:59,215 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:56:59,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash 920341577, now seen corresponding path program 1 times [2024-10-31 21:56:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:59,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974796239] [2024-10-31 21:56:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:59,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:59,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:56:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:59,638 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 21:56:59,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:59,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974796239] [2024-10-31 21:56:59,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974796239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:59,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:59,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:56:59,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349592620] [2024-10-31 21:56:59,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:59,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:56:59,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:59,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:56:59,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:56:59,641 INFO L87 Difference]: Start difference. First operand 386 states and 547 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:00,409 INFO L93 Difference]: Finished difference Result 518 states and 674 transitions. [2024-10-31 21:57:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:00,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-31 21:57:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:00,412 INFO L225 Difference]: With dead ends: 518 [2024-10-31 21:57:00,414 INFO L226 Difference]: Without dead ends: 518 [2024-10-31 21:57:00,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:57:00,415 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 280 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:00,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 706 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 21:57:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-10-31 21:57:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 383. [2024-10-31 21:57:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 300 states have (on average 1.7066666666666668) internal successors, (512), 368 states have internal predecessors, (512), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:57:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 542 transitions. [2024-10-31 21:57:00,431 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 542 transitions. Word has length 18 [2024-10-31 21:57:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:00,433 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 542 transitions. [2024-10-31 21:57:00,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 542 transitions. [2024-10-31 21:57:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 21:57:00,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:00,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:00,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:57:00,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:00,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1931813849, now seen corresponding path program 1 times [2024-10-31 21:57:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:00,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882176135] [2024-10-31 21:57:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:00,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:00,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:57:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:00,746 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 21:57:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882176135] [2024-10-31 21:57:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882176135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:00,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:00,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:57:00,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390614353] [2024-10-31 21:57:00,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:00,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:57:00,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:57:00,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:57:00,748 INFO L87 Difference]: Start difference. First operand 383 states and 542 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:01,249 INFO L93 Difference]: Finished difference Result 478 states and 643 transitions. [2024-10-31 21:57:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:57:01,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-31 21:57:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:01,253 INFO L225 Difference]: With dead ends: 478 [2024-10-31 21:57:01,253 INFO L226 Difference]: Without dead ends: 478 [2024-10-31 21:57:01,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:57:01,254 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 109 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:01,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1050 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:57:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-31 21:57:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 377. [2024-10-31 21:57:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 294 states have (on average 1.7040816326530612) internal successors, (501), 362 states have internal predecessors, (501), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:57:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 531 transitions. [2024-10-31 21:57:01,267 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 531 transitions. Word has length 21 [2024-10-31 21:57:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:01,268 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 531 transitions. [2024-10-31 21:57:01,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 531 transitions. [2024-10-31 21:57:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 21:57:01,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:01,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:01,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 21:57:01,272 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:01,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1757289300, now seen corresponding path program 1 times [2024-10-31 21:57:01,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:01,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615240856] [2024-10-31 21:57:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:01,614 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 21:57:01,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:01,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615240856] [2024-10-31 21:57:01,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615240856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:01,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:01,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:57:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38023313] [2024-10-31 21:57:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:01,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:57:01,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:57:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:57:01,616 INFO L87 Difference]: Start difference. First operand 377 states and 531 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:02,003 INFO L93 Difference]: Finished difference Result 504 states and 681 transitions. [2024-10-31 21:57:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:57:02,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-31 21:57:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:02,006 INFO L225 Difference]: With dead ends: 504 [2024-10-31 21:57:02,007 INFO L226 Difference]: Without dead ends: 504 [2024-10-31 21:57:02,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:57:02,008 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 140 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:02,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1080 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:57:02,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-10-31 21:57:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 395. [2024-10-31 21:57:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 312 states have (on average 1.6826923076923077) internal successors, (525), 378 states have internal predecessors, (525), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:57:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 555 transitions. [2024-10-31 21:57:02,023 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 555 transitions. Word has length 21 [2024-10-31 21:57:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:02,023 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 555 transitions. [2024-10-31 21:57:02,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 555 transitions. [2024-10-31 21:57:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 21:57:02,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:02,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:02,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 21:57:02,025 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:02,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:02,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2074565938, now seen corresponding path program 1 times [2024-10-31 21:57:02,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:02,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162025671] [2024-10-31 21:57:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:02,402 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 21:57:02,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162025671] [2024-10-31 21:57:02,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162025671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:02,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:02,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:57:02,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357975322] [2024-10-31 21:57:02,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:02,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:57:02,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:02,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:57:02,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:57:02,405 INFO L87 Difference]: Start difference. First operand 395 states and 555 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:02,814 INFO L93 Difference]: Finished difference Result 509 states and 685 transitions. [2024-10-31 21:57:02,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 21:57:02,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-31 21:57:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:02,816 INFO L225 Difference]: With dead ends: 509 [2024-10-31 21:57:02,816 INFO L226 Difference]: Without dead ends: 509 [2024-10-31 21:57:02,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:57:02,817 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 117 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:02,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1176 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:57:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-31 21:57:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 403. [2024-10-31 21:57:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 320 states have (on average 1.665625) internal successors, (533), 384 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:57:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 563 transitions. [2024-10-31 21:57:02,831 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 563 transitions. Word has length 22 [2024-10-31 21:57:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:02,832 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 563 transitions. [2024-10-31 21:57:02,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 563 transitions. [2024-10-31 21:57:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 21:57:02,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:02,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:02,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 21:57:02,833 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:02,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1039595598, now seen corresponding path program 1 times [2024-10-31 21:57:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:02,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554560426] [2024-10-31 21:57:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:02,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:57:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:02,901 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 21:57:02,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554560426] [2024-10-31 21:57:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554560426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:02,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123544135] [2024-10-31 21:57:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:02,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:02,903 INFO L87 Difference]: Start difference. First operand 403 states and 563 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:03,102 INFO L93 Difference]: Finished difference Result 408 states and 562 transitions. [2024-10-31 21:57:03,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:03,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-31 21:57:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:03,105 INFO L225 Difference]: With dead ends: 408 [2024-10-31 21:57:03,105 INFO L226 Difference]: Without dead ends: 408 [2024-10-31 21:57:03,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:03,106 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 30 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:03,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 479 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-31 21:57:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 402. [2024-10-31 21:57:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 383 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:57:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 554 transitions. [2024-10-31 21:57:03,117 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 554 transitions. Word has length 23 [2024-10-31 21:57:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:03,117 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 554 transitions. [2024-10-31 21:57:03,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 554 transitions. [2024-10-31 21:57:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 21:57:03,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:03,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:03,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 21:57:03,119 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:03,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:03,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1039595597, now seen corresponding path program 1 times [2024-10-31 21:57:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348525772] [2024-10-31 21:57:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:03,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:57:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:03,347 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 21:57:03,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:03,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348525772] [2024-10-31 21:57:03,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348525772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:03,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:03,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:57:03,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043331044] [2024-10-31 21:57:03,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:03,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:57:03,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:57:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:57:03,349 INFO L87 Difference]: Start difference. First operand 402 states and 554 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:03,619 INFO L93 Difference]: Finished difference Result 325 states and 425 transitions. [2024-10-31 21:57:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:57:03,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-31 21:57:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:03,621 INFO L225 Difference]: With dead ends: 325 [2024-10-31 21:57:03,621 INFO L226 Difference]: Without dead ends: 325 [2024-10-31 21:57:03,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:57:03,622 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 58 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:03,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1064 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-31 21:57:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 295. [2024-10-31 21:57:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 226 states have (on average 1.6371681415929205) internal successors, (370), 282 states have internal predecessors, (370), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 388 transitions. [2024-10-31 21:57:03,632 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 388 transitions. Word has length 23 [2024-10-31 21:57:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:03,632 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 388 transitions. [2024-10-31 21:57:03,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 388 transitions. [2024-10-31 21:57:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 21:57:03,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:03,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:03,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 21:57:03,633 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:03,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1218800521, now seen corresponding path program 1 times [2024-10-31 21:57:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319023406] [2024-10-31 21:57:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:03,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:03,691 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 21:57:03,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:03,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319023406] [2024-10-31 21:57:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319023406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:03,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:03,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514220561] [2024-10-31 21:57:03,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:03,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:03,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:03,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:03,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:03,695 INFO L87 Difference]: Start difference. First operand 295 states and 388 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:03,722 INFO L93 Difference]: Finished difference Result 304 states and 397 transitions. [2024-10-31 21:57:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:03,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-31 21:57:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:03,724 INFO L225 Difference]: With dead ends: 304 [2024-10-31 21:57:03,724 INFO L226 Difference]: Without dead ends: 304 [2024-10-31 21:57:03,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 21:57:03,725 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:03,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-31 21:57:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-10-31 21:57:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 235 states have (on average 1.6127659574468085) internal successors, (379), 291 states have internal predecessors, (379), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 397 transitions. [2024-10-31 21:57:03,734 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 397 transitions. Word has length 25 [2024-10-31 21:57:03,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:03,735 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 397 transitions. [2024-10-31 21:57:03,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 397 transitions. [2024-10-31 21:57:03,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 21:57:03,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:03,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:03,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 21:57:03,738 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:03,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:03,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1220647563, now seen corresponding path program 1 times [2024-10-31 21:57:03,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:03,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075005168] [2024-10-31 21:57:03,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:03,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:03,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:03,866 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 21:57:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:03,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075005168] [2024-10-31 21:57:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075005168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:03,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:57:03,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744483685] [2024-10-31 21:57:03,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:03,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:03,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:03,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:03,869 INFO L87 Difference]: Start difference. First operand 304 states and 397 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:04,070 INFO L93 Difference]: Finished difference Result 365 states and 478 transitions. [2024-10-31 21:57:04,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:04,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-31 21:57:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:04,072 INFO L225 Difference]: With dead ends: 365 [2024-10-31 21:57:04,073 INFO L226 Difference]: Without dead ends: 365 [2024-10-31 21:57:04,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:04,074 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 67 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:04,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 258 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-31 21:57:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 359. [2024-10-31 21:57:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 291 states have (on average 1.5807560137457044) internal successors, (460), 346 states have internal predecessors, (460), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 478 transitions. [2024-10-31 21:57:04,090 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 478 transitions. Word has length 25 [2024-10-31 21:57:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:04,091 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 478 transitions. [2024-10-31 21:57:04,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 478 transitions. [2024-10-31 21:57:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 21:57:04,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:04,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:04,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 21:57:04,092 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:04,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:04,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1220647562, now seen corresponding path program 1 times [2024-10-31 21:57:04,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:04,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89448357] [2024-10-31 21:57:04,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:04,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:04,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:04,141 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 21:57:04,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:04,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89448357] [2024-10-31 21:57:04,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89448357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:04,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:04,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:04,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611145088] [2024-10-31 21:57:04,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:04,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:57:04,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:04,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:57:04,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:57:04,145 INFO L87 Difference]: Start difference. First operand 359 states and 478 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:04,242 INFO L93 Difference]: Finished difference Result 356 states and 466 transitions. [2024-10-31 21:57:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:57:04,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-31 21:57:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:04,244 INFO L225 Difference]: With dead ends: 356 [2024-10-31 21:57:04,245 INFO L226 Difference]: Without dead ends: 356 [2024-10-31 21:57:04,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 21:57:04,246 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 28 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:04,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 238 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-31 21:57:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-10-31 21:57:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 291 states have (on average 1.5395189003436427) internal successors, (448), 343 states have internal predecessors, (448), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 466 transitions. [2024-10-31 21:57:04,257 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 466 transitions. Word has length 25 [2024-10-31 21:57:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:04,258 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 466 transitions. [2024-10-31 21:57:04,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 466 transitions. [2024-10-31 21:57:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 21:57:04,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:04,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:04,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 21:57:04,260 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:04,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:04,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1209666842, now seen corresponding path program 1 times [2024-10-31 21:57:04,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:04,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36459064] [2024-10-31 21:57:04,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:04,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:04,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:04,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36459064] [2024-10-31 21:57:04,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36459064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:04,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:04,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:57:04,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554598108] [2024-10-31 21:57:04,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:04,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:04,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:04,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:04,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:04,357 INFO L87 Difference]: Start difference. First operand 356 states and 466 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:04,392 INFO L93 Difference]: Finished difference Result 403 states and 520 transitions. [2024-10-31 21:57:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:57:04,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-31 21:57:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:04,394 INFO L225 Difference]: With dead ends: 403 [2024-10-31 21:57:04,394 INFO L226 Difference]: Without dead ends: 403 [2024-10-31 21:57:04,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:04,395 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 46 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:04,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 825 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-31 21:57:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 356. [2024-10-31 21:57:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 291 states have (on average 1.529209621993127) internal successors, (445), 343 states have internal predecessors, (445), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 463 transitions. [2024-10-31 21:57:04,406 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 463 transitions. Word has length 26 [2024-10-31 21:57:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:04,406 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 463 transitions. [2024-10-31 21:57:04,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 463 transitions. [2024-10-31 21:57:04,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 21:57:04,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:04,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:04,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 21:57:04,407 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:04,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2088228101, now seen corresponding path program 1 times [2024-10-31 21:57:04,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:04,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199600749] [2024-10-31 21:57:04,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:04,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:04,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:04,497 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 21:57:04,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:04,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199600749] [2024-10-31 21:57:04,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199600749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:04,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:57:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613601615] [2024-10-31 21:57:04,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:04,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:04,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:04,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:04,499 INFO L87 Difference]: Start difference. First operand 356 states and 463 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:04,648 INFO L93 Difference]: Finished difference Result 418 states and 544 transitions. [2024-10-31 21:57:04,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:04,649 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-31 21:57:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:04,652 INFO L225 Difference]: With dead ends: 418 [2024-10-31 21:57:04,652 INFO L226 Difference]: Without dead ends: 418 [2024-10-31 21:57:04,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:04,653 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 50 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:04,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 272 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-31 21:57:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 356. [2024-10-31 21:57:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 291 states have (on average 1.529209621993127) internal successors, (445), 343 states have internal predecessors, (445), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 463 transitions. [2024-10-31 21:57:04,664 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 463 transitions. Word has length 26 [2024-10-31 21:57:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:04,664 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 463 transitions. [2024-10-31 21:57:04,664 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 463 transitions. [2024-10-31 21:57:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 21:57:04,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:04,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:04,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 21:57:04,666 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:04,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:04,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1505674617, now seen corresponding path program 1 times [2024-10-31 21:57:04,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:04,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705241216] [2024-10-31 21:57:04,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:04,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:04,749 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 21:57:04,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:04,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705241216] [2024-10-31 21:57:04,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705241216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:04,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:04,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:57:04,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289416184] [2024-10-31 21:57:04,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:04,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:04,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:04,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:04,753 INFO L87 Difference]: Start difference. First operand 356 states and 463 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:04,782 INFO L93 Difference]: Finished difference Result 299 states and 376 transitions. [2024-10-31 21:57:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:57:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-31 21:57:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:04,785 INFO L225 Difference]: With dead ends: 299 [2024-10-31 21:57:04,785 INFO L226 Difference]: Without dead ends: 299 [2024-10-31 21:57:04,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:04,786 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 835 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 21:57:04,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 835 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-31 21:57:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-10-31 21:57:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 235 states have (on average 1.523404255319149) internal successors, (358), 286 states have internal predecessors, (358), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 376 transitions. [2024-10-31 21:57:04,794 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 376 transitions. Word has length 26 [2024-10-31 21:57:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:04,795 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 376 transitions. [2024-10-31 21:57:04,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 376 transitions. [2024-10-31 21:57:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 21:57:04,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:04,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:04,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 21:57:04,796 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:04,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:04,797 INFO L85 PathProgramCache]: Analyzing trace with hash 516237483, now seen corresponding path program 1 times [2024-10-31 21:57:04,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:04,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233562782] [2024-10-31 21:57:04,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:04,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:04,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:04,926 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 21:57:04,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:04,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233562782] [2024-10-31 21:57:04,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233562782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:04,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:04,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:57:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035137970] [2024-10-31 21:57:04,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:04,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:57:04,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:04,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:57:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:04,929 INFO L87 Difference]: Start difference. First operand 299 states and 376 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:05,104 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2024-10-31 21:57:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:57:05,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-31 21:57:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:05,106 INFO L225 Difference]: With dead ends: 334 [2024-10-31 21:57:05,106 INFO L226 Difference]: Without dead ends: 334 [2024-10-31 21:57:05,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:57:05,107 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:05,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 709 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-31 21:57:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 329. [2024-10-31 21:57:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 316 states have internal predecessors, (393), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 411 transitions. [2024-10-31 21:57:05,115 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 411 transitions. Word has length 27 [2024-10-31 21:57:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:05,116 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 411 transitions. [2024-10-31 21:57:05,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 411 transitions. [2024-10-31 21:57:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 21:57:05,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:05,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:05,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-31 21:57:05,117 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:05,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:05,118 INFO L85 PathProgramCache]: Analyzing trace with hash 516237677, now seen corresponding path program 1 times [2024-10-31 21:57:05,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:05,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632097548] [2024-10-31 21:57:05,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:05,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:05,231 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 21:57:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:05,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632097548] [2024-10-31 21:57:05,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632097548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:05,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:05,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:05,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120516711] [2024-10-31 21:57:05,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:05,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:05,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:05,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:05,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:05,234 INFO L87 Difference]: Start difference. First operand 329 states and 411 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:05,298 INFO L93 Difference]: Finished difference Result 440 states and 551 transitions. [2024-10-31 21:57:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:05,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-31 21:57:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:05,300 INFO L225 Difference]: With dead ends: 440 [2024-10-31 21:57:05,301 INFO L226 Difference]: Without dead ends: 440 [2024-10-31 21:57:05,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:05,302 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 80 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:05,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 328 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-31 21:57:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 415. [2024-10-31 21:57:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 351 states have (on average 1.4672364672364673) internal successors, (515), 402 states have internal predecessors, (515), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 533 transitions. [2024-10-31 21:57:05,313 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 533 transitions. Word has length 27 [2024-10-31 21:57:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:05,313 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 533 transitions. [2024-10-31 21:57:05,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 533 transitions. [2024-10-31 21:57:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 21:57:05,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:05,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:05,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-31 21:57:05,314 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1037479271, now seen corresponding path program 1 times [2024-10-31 21:57:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:05,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213598434] [2024-10-31 21:57:05,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:05,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:05,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:05,408 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 21:57:05,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:05,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213598434] [2024-10-31 21:57:05,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213598434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:05,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:57:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230156608] [2024-10-31 21:57:05,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:05,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:05,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:05,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:05,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:05,411 INFO L87 Difference]: Start difference. First operand 415 states and 533 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:05,575 INFO L93 Difference]: Finished difference Result 440 states and 545 transitions. [2024-10-31 21:57:05,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:05,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-31 21:57:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:05,577 INFO L225 Difference]: With dead ends: 440 [2024-10-31 21:57:05,577 INFO L226 Difference]: Without dead ends: 440 [2024-10-31 21:57:05,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:05,578 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 57 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:05,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 365 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-31 21:57:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 328. [2024-10-31 21:57:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 265 states have (on average 1.460377358490566) internal successors, (387), 315 states have internal predecessors, (387), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 405 transitions. [2024-10-31 21:57:05,590 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 405 transitions. Word has length 28 [2024-10-31 21:57:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:05,590 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 405 transitions. [2024-10-31 21:57:05,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 405 transitions. [2024-10-31 21:57:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-31 21:57:05,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:05,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:05,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-31 21:57:05,592 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:05,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash -734692199, now seen corresponding path program 1 times [2024-10-31 21:57:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441496262] [2024-10-31 21:57:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:05,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:05,681 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 21:57:05,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441496262] [2024-10-31 21:57:05,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441496262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:05,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:05,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:05,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613943768] [2024-10-31 21:57:05,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:05,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:05,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:05,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:05,683 INFO L87 Difference]: Start difference. First operand 328 states and 405 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:05,895 INFO L93 Difference]: Finished difference Result 329 states and 405 transitions. [2024-10-31 21:57:05,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:57:05,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-10-31 21:57:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:05,897 INFO L225 Difference]: With dead ends: 329 [2024-10-31 21:57:05,897 INFO L226 Difference]: Without dead ends: 329 [2024-10-31 21:57:05,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:05,898 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 52 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:05,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 533 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-31 21:57:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-10-31 21:57:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 265 states have (on average 1.4528301886792452) internal successors, (385), 314 states have internal predecessors, (385), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 403 transitions. [2024-10-31 21:57:05,907 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 403 transitions. Word has length 35 [2024-10-31 21:57:05,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:05,907 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 403 transitions. [2024-10-31 21:57:05,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 403 transitions. [2024-10-31 21:57:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-31 21:57:05,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:05,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:05,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-31 21:57:05,908 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:05,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:05,909 INFO L85 PathProgramCache]: Analyzing trace with hash -734692198, now seen corresponding path program 1 times [2024-10-31 21:57:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:05,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30217390] [2024-10-31 21:57:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:05,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:06,124 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 21:57:06,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:06,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30217390] [2024-10-31 21:57:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30217390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791853450] [2024-10-31 21:57:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:06,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:06,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:06,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:06,126 INFO L87 Difference]: Start difference. First operand 327 states and 403 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:06,340 INFO L93 Difference]: Finished difference Result 328 states and 403 transitions. [2024-10-31 21:57:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:57:06,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-10-31 21:57:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:06,344 INFO L225 Difference]: With dead ends: 328 [2024-10-31 21:57:06,344 INFO L226 Difference]: Without dead ends: 328 [2024-10-31 21:57:06,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:06,345 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 40 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:06,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 537 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-31 21:57:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2024-10-31 21:57:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 265 states have (on average 1.4452830188679244) internal successors, (383), 313 states have internal predecessors, (383), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 401 transitions. [2024-10-31 21:57:06,354 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 401 transitions. Word has length 35 [2024-10-31 21:57:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:06,354 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 401 transitions. [2024-10-31 21:57:06,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 401 transitions. [2024-10-31 21:57:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-31 21:57:06,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:06,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-31 21:57:06,355 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1664563334, now seen corresponding path program 1 times [2024-10-31 21:57:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:06,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006775409] [2024-10-31 21:57:06,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:06,454 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 21:57:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006775409] [2024-10-31 21:57:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006775409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:06,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:06,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:06,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404523497] [2024-10-31 21:57:06,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:06,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:06,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:06,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:06,456 INFO L87 Difference]: Start difference. First operand 326 states and 401 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:06,601 INFO L93 Difference]: Finished difference Result 369 states and 451 transitions. [2024-10-31 21:57:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:06,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-10-31 21:57:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:06,605 INFO L225 Difference]: With dead ends: 369 [2024-10-31 21:57:06,605 INFO L226 Difference]: Without dead ends: 369 [2024-10-31 21:57:06,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:06,606 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 100 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:06,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 341 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-31 21:57:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 323. [2024-10-31 21:57:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 310 states have internal predecessors, (377), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 395 transitions. [2024-10-31 21:57:06,614 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 395 transitions. Word has length 37 [2024-10-31 21:57:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:06,615 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 395 transitions. [2024-10-31 21:57:06,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 395 transitions. [2024-10-31 21:57:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-31 21:57:06,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:06,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:06,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-31 21:57:06,617 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:06,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1664563333, now seen corresponding path program 1 times [2024-10-31 21:57:06,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:06,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856575306] [2024-10-31 21:57:06,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:06,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:06,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:06,822 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 21:57:06,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856575306] [2024-10-31 21:57:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856575306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:06,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:06,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:06,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10217532] [2024-10-31 21:57:06,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:06,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:06,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:06,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:06,824 INFO L87 Difference]: Start difference. First operand 323 states and 395 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:07,086 INFO L93 Difference]: Finished difference Result 368 states and 449 transitions. [2024-10-31 21:57:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:57:07,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-10-31 21:57:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:07,088 INFO L225 Difference]: With dead ends: 368 [2024-10-31 21:57:07,088 INFO L226 Difference]: Without dead ends: 368 [2024-10-31 21:57:07,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:57:07,089 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 289 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:07,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 416 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-31 21:57:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 322. [2024-10-31 21:57:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 265 states have (on average 1.4150943396226414) internal successors, (375), 309 states have internal predecessors, (375), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 393 transitions. [2024-10-31 21:57:07,098 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 393 transitions. Word has length 37 [2024-10-31 21:57:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:07,098 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 393 transitions. [2024-10-31 21:57:07,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 393 transitions. [2024-10-31 21:57:07,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-31 21:57:07,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:07,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:07,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-31 21:57:07,099 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:07,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:07,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1664563172, now seen corresponding path program 1 times [2024-10-31 21:57:07,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:07,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947880949] [2024-10-31 21:57:07,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:07,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:07,359 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 21:57:07,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:07,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947880949] [2024-10-31 21:57:07,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947880949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:07,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:07,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:07,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563740271] [2024-10-31 21:57:07,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:07,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:07,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:07,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:07,361 INFO L87 Difference]: Start difference. First operand 322 states and 393 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:07,693 INFO L93 Difference]: Finished difference Result 389 states and 444 transitions. [2024-10-31 21:57:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-10-31 21:57:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:07,695 INFO L225 Difference]: With dead ends: 389 [2024-10-31 21:57:07,695 INFO L226 Difference]: Without dead ends: 389 [2024-10-31 21:57:07,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:07,696 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 192 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:07,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 283 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:57:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-31 21:57:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 322. [2024-10-31 21:57:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 265 states have (on average 1.4075471698113207) internal successors, (373), 309 states have internal predecessors, (373), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 391 transitions. [2024-10-31 21:57:07,708 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 391 transitions. Word has length 37 [2024-10-31 21:57:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:07,708 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 391 transitions. [2024-10-31 21:57:07,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 391 transitions. [2024-10-31 21:57:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-31 21:57:07,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:07,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:07,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-31 21:57:07,709 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:07,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1071259938, now seen corresponding path program 1 times [2024-10-31 21:57:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763296098] [2024-10-31 21:57:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:07,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763296098] [2024-10-31 21:57:07,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763296098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:07,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:07,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527503013] [2024-10-31 21:57:07,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:07,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:07,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:07,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:07,916 INFO L87 Difference]: Start difference. First operand 322 states and 391 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:08,082 INFO L93 Difference]: Finished difference Result 326 states and 395 transitions. [2024-10-31 21:57:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:08,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-10-31 21:57:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:08,084 INFO L225 Difference]: With dead ends: 326 [2024-10-31 21:57:08,084 INFO L226 Difference]: Without dead ends: 326 [2024-10-31 21:57:08,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:08,085 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 129 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:08,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 278 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-31 21:57:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 323. [2024-10-31 21:57:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 267 states have (on average 1.404494382022472) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 393 transitions. [2024-10-31 21:57:08,092 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 393 transitions. Word has length 48 [2024-10-31 21:57:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:08,093 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 393 transitions. [2024-10-31 21:57:08,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 393 transitions. [2024-10-31 21:57:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-31 21:57:08,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:08,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:08,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-31 21:57:08,094 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:08,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:08,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1071260000, now seen corresponding path program 1 times [2024-10-31 21:57:08,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:08,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869444179] [2024-10-31 21:57:08,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:08,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:08,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:08,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:08,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869444179] [2024-10-31 21:57:08,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869444179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:08,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:08,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943530585] [2024-10-31 21:57:08,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:08,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:08,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:08,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:08,278 INFO L87 Difference]: Start difference. First operand 323 states and 393 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:08,456 INFO L93 Difference]: Finished difference Result 325 states and 393 transitions. [2024-10-31 21:57:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:08,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-10-31 21:57:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:08,457 INFO L225 Difference]: With dead ends: 325 [2024-10-31 21:57:08,457 INFO L226 Difference]: Without dead ends: 325 [2024-10-31 21:57:08,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:08,458 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 240 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:08,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 310 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:08,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-31 21:57:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2024-10-31 21:57:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 265 states have (on average 1.3962264150943395) internal successors, (370), 307 states have internal predecessors, (370), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 388 transitions. [2024-10-31 21:57:08,469 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 388 transitions. Word has length 48 [2024-10-31 21:57:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:08,470 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 388 transitions. [2024-10-31 21:57:08,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 388 transitions. [2024-10-31 21:57:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-31 21:57:08,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:08,473 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:08,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-31 21:57:08,473 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:08,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash 122043664, now seen corresponding path program 1 times [2024-10-31 21:57:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8592981] [2024-10-31 21:57:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:08,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:08,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:08,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 21:57:08,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8592981] [2024-10-31 21:57:08,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8592981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:57:08,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117443713] [2024-10-31 21:57:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:08,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:08,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:08,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:57:08,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 21:57:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:08,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-31 21:57:08,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:09,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:57:09,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117443713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:09,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 21:57:09,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-31 21:57:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87244566] [2024-10-31 21:57:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:09,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:09,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-31 21:57:09,305 INFO L87 Difference]: Start difference. First operand 320 states and 388 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 21:57:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:09,501 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2024-10-31 21:57:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2024-10-31 21:57:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:09,503 INFO L225 Difference]: With dead ends: 320 [2024-10-31 21:57:09,503 INFO L226 Difference]: Without dead ends: 320 [2024-10-31 21:57:09,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:57:09,505 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 184 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:09,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 265 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-31 21:57:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2024-10-31 21:57:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 265 states have (on average 1.3849056603773584) internal successors, (367), 305 states have internal predecessors, (367), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-31 21:57:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 385 transitions. [2024-10-31 21:57:09,513 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 385 transitions. Word has length 50 [2024-10-31 21:57:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:09,513 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 385 transitions. [2024-10-31 21:57:09,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-31 21:57:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 385 transitions. [2024-10-31 21:57:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-31 21:57:09,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:09,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:09,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 21:57:09,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a254292-59a6-4f36-818d-18656089f6b8/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-31 21:57:09,719 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:09,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1996957779, now seen corresponding path program 1 times [2024-10-31 21:57:09,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:09,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630925770] [2024-10-31 21:57:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:10,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630925770] [2024-10-31 21:57:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630925770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:10,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:10,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 21:57:10,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757373636] [2024-10-31 21:57:10,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:10,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 21:57:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:10,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 21:57:10,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:57:10,405 INFO L87 Difference]: Start difference. First operand 318 states and 385 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:11,126 INFO L93 Difference]: Finished difference Result 657 states and 807 transitions. [2024-10-31 21:57:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 21:57:11,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2024-10-31 21:57:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:11,129 INFO L225 Difference]: With dead ends: 657 [2024-10-31 21:57:11,129 INFO L226 Difference]: Without dead ends: 657 [2024-10-31 21:57:11,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-31 21:57:11,130 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 419 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:11,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1211 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 21:57:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-31 21:57:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 464. [2024-10-31 21:57:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 404 states have (on average 1.381188118811881) internal successors, (558), 447 states have internal predecessors, (558), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-10-31 21:57:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 588 transitions. [2024-10-31 21:57:11,167 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 588 transitions. Word has length 51 [2024-10-31 21:57:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:11,167 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 588 transitions. [2024-10-31 21:57:11,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 588 transitions. [2024-10-31 21:57:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-31 21:57:11,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:11,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:11,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-31 21:57:11,168 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:11,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1996957778, now seen corresponding path program 1 times [2024-10-31 21:57:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:11,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147242573] [2024-10-31 21:57:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147242573] [2024-10-31 21:57:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147242573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:11,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:11,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 21:57:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365005688] [2024-10-31 21:57:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:11,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 21:57:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:11,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 21:57:11,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:57:11,894 INFO L87 Difference]: Start difference. First operand 464 states and 588 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:12,674 INFO L93 Difference]: Finished difference Result 700 states and 866 transitions. [2024-10-31 21:57:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 21:57:12,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2024-10-31 21:57:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:12,676 INFO L225 Difference]: With dead ends: 700 [2024-10-31 21:57:12,677 INFO L226 Difference]: Without dead ends: 700 [2024-10-31 21:57:12,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-10-31 21:57:12,677 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 333 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:12,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1065 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 21:57:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-31 21:57:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 514. [2024-10-31 21:57:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 450 states have (on average 1.3977777777777778) internal successors, (629), 495 states have internal predecessors, (629), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-31 21:57:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 665 transitions. [2024-10-31 21:57:12,692 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 665 transitions. Word has length 51 [2024-10-31 21:57:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:12,692 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 665 transitions. [2024-10-31 21:57:12,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 665 transitions. [2024-10-31 21:57:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-31 21:57:12,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:12,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:12,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-31 21:57:12,693 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:12,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1995110737, now seen corresponding path program 1 times [2024-10-31 21:57:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715640033] [2024-10-31 21:57:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:13,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:13,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715640033] [2024-10-31 21:57:13,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715640033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:13,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:13,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 21:57:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569553068] [2024-10-31 21:57:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:13,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 21:57:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:13,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 21:57:13,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:57:13,785 INFO L87 Difference]: Start difference. First operand 514 states and 665 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:14,727 INFO L93 Difference]: Finished difference Result 543 states and 695 transitions. [2024-10-31 21:57:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 21:57:14,728 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2024-10-31 21:57:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:14,730 INFO L225 Difference]: With dead ends: 543 [2024-10-31 21:57:14,731 INFO L226 Difference]: Without dead ends: 543 [2024-10-31 21:57:14,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-31 21:57:14,732 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 77 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:14,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1153 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 21:57:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-31 21:57:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 534. [2024-10-31 21:57:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 470 states have (on average 1.3829787234042554) internal successors, (650), 515 states have internal predecessors, (650), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-31 21:57:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 686 transitions. [2024-10-31 21:57:14,748 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 686 transitions. Word has length 51 [2024-10-31 21:57:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:14,748 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 686 transitions. [2024-10-31 21:57:14,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:57:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 686 transitions. [2024-10-31 21:57:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-31 21:57:14,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:14,750 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, 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 21:57:14,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-31 21:57:14,750 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-31 21:57:14,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1999969648, now seen corresponding path program 1 times [2024-10-31 21:57:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765791592] [2024-10-31 21:57:14,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:15,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-31 21:57:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:15,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765791592] [2024-10-31 21:57:15,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765791592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:15,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:15,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 21:57:15,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302082797] [2024-10-31 21:57:15,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:15,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-31 21:57:15,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:15,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-31 21:57:15,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-31 21:57:15,707 INFO L87 Difference]: Start difference. First operand 534 states and 686 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)