./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/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_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_malloc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/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 64bit --witnessprinter.graph.data.programhash dea536aba24bbbd149deffc3b8406a97f6fac760a5b2f50471455440f523d7fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:01:16,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:01:16,399 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-31 22:01:16,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:01:16,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:01:16,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:01:16,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:01:16,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:01:16,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:01:16,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:01:16,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:01:16,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:01:16,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:01:16,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:01:16,433 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:01:16,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:01:16,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:01:16,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:01:16,435 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:01:16,435 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:01:16,436 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:01:16,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:01:16,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:01:16,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:01:16,437 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:01:16,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:01:16,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:01:16,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:01:16,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:01:16,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:01:16,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:01:16,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:01:16,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:01:16,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:01:16,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:01:16,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:01:16,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:01:16,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:01:16,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:01:16,444 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_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/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_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dea536aba24bbbd149deffc3b8406a97f6fac760a5b2f50471455440f523d7fc [2024-10-31 22:01:16,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:01:16,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:01:16,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:01:16,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:01:16,751 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:01:16,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/termination-15/cstrcspn_malloc.i Unable to find full path for "g++" [2024-10-31 22:01:18,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:01:19,280 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:01:19,283 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2024-10-31 22:01:19,295 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/data/768df5fd3/ed6e8e4ea66348f483ca2a6fec51f3f7/FLAGffb833714 [2024-10-31 22:01:19,317 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/data/768df5fd3/ed6e8e4ea66348f483ca2a6fec51f3f7 [2024-10-31 22:01:19,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:01:19,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:01:19,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:01:19,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:01:19,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:01:19,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc835e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19, skipping insertion in model container [2024-10-31 22:01:19,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:01:19,764 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 22:01:19,765 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 22:01:19,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:01:19,783 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:01:19,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:01:19,890 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:01:19,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19 WrapperNode [2024-10-31 22:01:19,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:01:19,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:01:19,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:01:19,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:01:19,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,944 INFO L138 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2024-10-31 22:01:19,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:01:19,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:01:19,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:01:19,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:01:19,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,979 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-10-31 22:01:19,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:19,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:01:19,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:01:19,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:01:19,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:01:20,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (1/1) ... [2024-10-31 22:01:20,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:01:20,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:20,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:01:20,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:01:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:01:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:01:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:01:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:01:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:01:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:01:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:01:20,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:01:20,181 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:01:20,183 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:01:20,503 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-31 22:01:20,504 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:01:20,520 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:01:20,521 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-31 22:01:20,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:20 BoogieIcfgContainer [2024-10-31 22:01:20,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:01:20,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:01:20,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:01:20,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:01:20,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:01:19" (1/3) ... [2024-10-31 22:01:20,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1e7323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:01:20, skipping insertion in model container [2024-10-31 22:01:20,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:19" (2/3) ... [2024-10-31 22:01:20,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1e7323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:01:20, skipping insertion in model container [2024-10-31 22:01:20,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:20" (3/3) ... [2024-10-31 22:01:20,530 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcspn_malloc.i [2024-10-31 22:01:20,546 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:01:20,546 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-10-31 22:01:20,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:01:20,596 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;@2305a771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:01:20,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-10-31 22:01:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.935483870967742) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-31 22:01:20,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:20,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:01:20,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:20,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2024-10-31 22:01:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:20,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943314334] [2024-10-31 22:01:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:21,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:21,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943314334] [2024-10-31 22:01:21,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943314334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:21,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:21,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:01:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751741869] [2024-10-31 22:01:21,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:21,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:01:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:21,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:21,098 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.935483870967742) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 22:01:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:21,182 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-10-31 22:01:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:21,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 22:01:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:21,193 INFO L225 Difference]: With dead ends: 51 [2024-10-31 22:01:21,194 INFO L226 Difference]: Without dead ends: 49 [2024-10-31 22:01:21,195 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 22:01:21,201 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:21,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-31 22:01:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-31 22:01:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.8) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-10-31 22:01:21,245 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 6 [2024-10-31 22:01:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:21,245 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-10-31 22:01:21,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 22:01:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-10-31 22:01:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-31 22:01:21,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:21,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:01:21,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:01:21,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:21,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2024-10-31 22:01:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:21,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248502502] [2024-10-31 22:01:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:21,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:21,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:21,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248502502] [2024-10-31 22:01:21,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248502502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:21,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:21,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441633325] [2024-10-31 22:01:21,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:21,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:21,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:21,611 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 22:01:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:21,647 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-10-31 22:01:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:21,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 22:01:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:21,649 INFO L225 Difference]: With dead ends: 52 [2024-10-31 22:01:21,649 INFO L226 Difference]: Without dead ends: 52 [2024-10-31 22:01:21,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 22:01:21,651 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:21,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-31 22:01:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-31 22:01:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-10-31 22:01:21,663 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 6 [2024-10-31 22:01:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:21,664 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-10-31 22:01:21,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 22:01:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-10-31 22:01:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-31 22:01:21,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:21,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:01:21,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:01:21,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:21,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2024-10-31 22:01:21,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:21,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930459210] [2024-10-31 22:01:21,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:21,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:21,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:21,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930459210] [2024-10-31 22:01:21,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930459210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:21,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:21,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:21,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520361847] [2024-10-31 22:01:21,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:21,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:01:21,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:21,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:01:21,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:21,951 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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 22:01:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:22,074 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-10-31 22:01:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:01:22,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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 22:01:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:22,076 INFO L225 Difference]: With dead ends: 51 [2024-10-31 22:01:22,076 INFO L226 Difference]: Without dead ends: 51 [2024-10-31 22:01:22,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:22,078 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:22,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-31 22:01:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-10-31 22:01:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2024-10-31 22:01:22,095 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 6 [2024-10-31 22:01:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:22,096 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2024-10-31 22:01:22,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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 22:01:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2024-10-31 22:01:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 22:01:22,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:22,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:22,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:01:22,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:22,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2024-10-31 22:01:22,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:22,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879125949] [2024-10-31 22:01:22,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:22,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:22,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879125949] [2024-10-31 22:01:22,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879125949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:22,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:22,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:01:22,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763561656] [2024-10-31 22:01:22,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:22,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:01:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:22,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:22,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:22,143 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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 22:01:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:22,187 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-10-31 22:01:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:22,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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 22:01:22,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:22,189 INFO L225 Difference]: With dead ends: 47 [2024-10-31 22:01:22,191 INFO L226 Difference]: Without dead ends: 47 [2024-10-31 22:01:22,192 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 22:01:22,193 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 35 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:22,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 43 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-31 22:01:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-31 22:01:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-10-31 22:01:22,204 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 7 [2024-10-31 22:01:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:22,205 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-10-31 22:01:22,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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 22:01:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-10-31 22:01:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 22:01:22,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:22,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:22,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:01:22,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:22,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:22,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2024-10-31 22:01:22,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:22,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078124315] [2024-10-31 22:01:22,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:22,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078124315] [2024-10-31 22:01:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078124315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:22,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:22,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:22,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658913911] [2024-10-31 22:01:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:22,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:22,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:22,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:22,394 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:22,416 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-10-31 22:01:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-31 22:01:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:22,420 INFO L225 Difference]: With dead ends: 50 [2024-10-31 22:01:22,420 INFO L226 Difference]: Without dead ends: 50 [2024-10-31 22:01:22,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 22:01:22,422 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:22,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-31 22:01:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-31 22:01:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-10-31 22:01:22,433 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 7 [2024-10-31 22:01:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:22,434 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-10-31 22:01:22,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-10-31 22:01:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-31 22:01:22,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:22,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:22,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:01:22,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:22,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:22,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088457, now seen corresponding path program 1 times [2024-10-31 22:01:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:22,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937643797] [2024-10-31 22:01:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:22,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:22,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937643797] [2024-10-31 22:01:22,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937643797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:22,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:22,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:22,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005345167] [2024-10-31 22:01:22,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:22,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:01:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:22,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:01:22,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:22,620 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:22,645 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-10-31 22:01:22,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:01:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-31 22:01:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:22,649 INFO L225 Difference]: With dead ends: 49 [2024-10-31 22:01:22,650 INFO L226 Difference]: Without dead ends: 49 [2024-10-31 22:01:22,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:22,651 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:22,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-31 22:01:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-10-31 22:01:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.7) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-10-31 22:01:22,662 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 7 [2024-10-31 22:01:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:22,662 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-10-31 22:01:22,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-10-31 22:01:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-31 22:01:22,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:22,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:22,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:01:22,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:22,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash -534039922, now seen corresponding path program 1 times [2024-10-31 22:01:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135303665] [2024-10-31 22:01:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,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 22:01:22,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:22,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135303665] [2024-10-31 22:01:22,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135303665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:22,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:22,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:22,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259648889] [2024-10-31 22:01:22,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:22,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:22,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:22,738 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:22,800 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-31 22:01:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-31 22:01:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:22,801 INFO L225 Difference]: With dead ends: 44 [2024-10-31 22:01:22,802 INFO L226 Difference]: Without dead ends: 44 [2024-10-31 22:01:22,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:22,803 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:22,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 50 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-31 22:01:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-31 22:01:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-10-31 22:01:22,807 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 9 [2024-10-31 22:01:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:22,807 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-10-31 22:01:22,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-10-31 22:01:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-31 22:01:22,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:22,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:22,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:01:22,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:22,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:22,809 INFO L85 PathProgramCache]: Analyzing trace with hash -534039921, now seen corresponding path program 1 times [2024-10-31 22:01:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:22,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064557686] [2024-10-31 22:01:22,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:22,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064557686] [2024-10-31 22:01:22,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064557686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:22,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:22,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:01:22,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653135930] [2024-10-31 22:01:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:22,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:01:22,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:22,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:01:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:01:22,940 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:23,057 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-10-31 22:01:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:01:23,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-31 22:01:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:23,060 INFO L225 Difference]: With dead ends: 63 [2024-10-31 22:01:23,060 INFO L226 Difference]: Without dead ends: 63 [2024-10-31 22:01:23,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:01:23,062 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 74 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:23,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 98 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-31 22:01:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2024-10-31 22:01:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-10-31 22:01:23,074 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 9 [2024-10-31 22:01:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:23,074 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-31 22:01:23,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-10-31 22:01:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-31 22:01:23,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:23,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:23,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:01:23,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:23,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1693144940, now seen corresponding path program 1 times [2024-10-31 22:01:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:23,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41639477] [2024-10-31 22:01:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41639477] [2024-10-31 22:01:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41639477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273683772] [2024-10-31 22:01:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:23,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:01:23,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:23,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:01:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:23,188 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:23,268 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-10-31 22:01:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:01:23,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-31 22:01:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:23,269 INFO L225 Difference]: With dead ends: 43 [2024-10-31 22:01:23,269 INFO L226 Difference]: Without dead ends: 43 [2024-10-31 22:01:23,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:01:23,272 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:23,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 65 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-31 22:01:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-31 22:01:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-31 22:01:23,279 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 13 [2024-10-31 22:01:23,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:23,280 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-31 22:01:23,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-10-31 22:01:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-31 22:01:23,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:23,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:23,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:01:23,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1693144939, now seen corresponding path program 1 times [2024-10-31 22:01:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091691146] [2024-10-31 22:01:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:23,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:23,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091691146] [2024-10-31 22:01:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091691146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:23,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:01:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761537945] [2024-10-31 22:01:23,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:23,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:01:23,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:23,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:01:23,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:01:23,549 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:23,662 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-10-31 22:01:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:01:23,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-31 22:01:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:23,664 INFO L225 Difference]: With dead ends: 49 [2024-10-31 22:01:23,664 INFO L226 Difference]: Without dead ends: 49 [2024-10-31 22:01:23,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:01:23,665 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 77 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:23,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 97 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-31 22:01:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-31 22:01:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.425) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-10-31 22:01:23,674 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 13 [2024-10-31 22:01:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:23,675 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-10-31 22:01:23,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-10-31 22:01:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 22:01:23,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:23,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:23,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:01:23,676 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:23,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:23,677 INFO L85 PathProgramCache]: Analyzing trace with hash -948409995, now seen corresponding path program 1 times [2024-10-31 22:01:23,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:23,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007732188] [2024-10-31 22:01:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:23,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:23,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:23,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007732188] [2024-10-31 22:01:23,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007732188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:23,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:23,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:01:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739388417] [2024-10-31 22:01:23,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:23,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:01:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:23,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:23,732 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:23,746 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-10-31 22:01:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-31 22:01:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:23,748 INFO L225 Difference]: With dead ends: 48 [2024-10-31 22:01:23,749 INFO L226 Difference]: Without dead ends: 48 [2024-10-31 22:01:23,749 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 22:01:23,750 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:23,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 47 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-31 22:01:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-31 22:01:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.4) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-10-31 22:01:23,759 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 14 [2024-10-31 22:01:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:23,759 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-10-31 22:01:23,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-10-31 22:01:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-31 22:01:23,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:23,760 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 22:01:23,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:01:23,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:23,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash 950889964, now seen corresponding path program 1 times [2024-10-31 22:01:23,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:23,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401247092] [2024-10-31 22:01:23,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:23,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:23,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:23,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401247092] [2024-10-31 22:01:23,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401247092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:23,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:23,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:23,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615359448] [2024-10-31 22:01:23,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:23,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:01:23,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:23,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:23,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:23,793 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:23,808 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-10-31 22:01:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:23,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-31 22:01:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:23,809 INFO L225 Difference]: With dead ends: 50 [2024-10-31 22:01:23,810 INFO L226 Difference]: Without dead ends: 50 [2024-10-31 22:01:23,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:23,811 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:23,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-31 22:01:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-31 22:01:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.380952380952381) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-10-31 22:01:23,814 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 17 [2024-10-31 22:01:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:23,814 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-10-31 22:01:23,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-10-31 22:01:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-31 22:01:23,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:23,815 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 22:01:23,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:01:23,816 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:23,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1787173696, now seen corresponding path program 1 times [2024-10-31 22:01:23,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:23,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296197568] [2024-10-31 22:01:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:23,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:23,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:23,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296197568] [2024-10-31 22:01:23,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296197568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:23,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:23,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:01:23,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015963276] [2024-10-31 22:01:23,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:23,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:01:23,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:23,853 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:23,868 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-10-31 22:01:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:23,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-31 22:01:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:23,869 INFO L225 Difference]: With dead ends: 49 [2024-10-31 22:01:23,869 INFO L226 Difference]: Without dead ends: 49 [2024-10-31 22:01:23,869 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 22:01:23,870 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:23,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 41 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-31 22:01:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-31 22:01:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-10-31 22:01:23,873 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 17 [2024-10-31 22:01:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:23,873 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-10-31 22:01:23,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-10-31 22:01:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:01:23,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:23,874 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 22:01:23,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:01:23,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:23,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:23,875 INFO L85 PathProgramCache]: Analyzing trace with hash 432190393, now seen corresponding path program 1 times [2024-10-31 22:01:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:23,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137083276] [2024-10-31 22:01:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:23,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:23,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:23,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137083276] [2024-10-31 22:01:23,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137083276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:23,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:23,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224524951] [2024-10-31 22:01:23,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:23,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:01:23,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:23,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:01:23,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:23,979 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:24,010 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-10-31 22:01:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:24,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-31 22:01:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:24,011 INFO L225 Difference]: With dead ends: 48 [2024-10-31 22:01:24,011 INFO L226 Difference]: Without dead ends: 48 [2024-10-31 22:01:24,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 22:01:24,012 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 62 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:24,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 40 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-31 22:01:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-31 22:01:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-10-31 22:01:24,015 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 18 [2024-10-31 22:01:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:24,016 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-10-31 22:01:24,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-10-31 22:01:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:01:24,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:24,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:24,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:01:24,017 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:24,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1028637879, now seen corresponding path program 1 times [2024-10-31 22:01:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:24,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177325282] [2024-10-31 22:01:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:24,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:01:24,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:24,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177325282] [2024-10-31 22:01:24,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177325282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:24,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:24,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:01:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394696016] [2024-10-31 22:01:24,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:24,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:01:24,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:24,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:01:24,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:01:24,235 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:24,328 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-10-31 22:01:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:01:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-31 22:01:24,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:24,330 INFO L225 Difference]: With dead ends: 58 [2024-10-31 22:01:24,330 INFO L226 Difference]: Without dead ends: 58 [2024-10-31 22:01:24,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:01:24,331 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:24,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-31 22:01:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2024-10-31 22:01:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-10-31 22:01:24,334 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 19 [2024-10-31 22:01:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:24,334 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-10-31 22:01:24,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-10-31 22:01:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:01:24,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:24,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:24,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:01:24,336 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:24,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash 513000419, now seen corresponding path program 1 times [2024-10-31 22:01:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:24,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892634035] [2024-10-31 22:01:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:24,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:24,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892634035] [2024-10-31 22:01:24,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892634035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:24,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:24,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:24,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348977113] [2024-10-31 22:01:24,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:24,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:01:24,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:24,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:01:24,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:24,576 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:24,625 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-10-31 22:01:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:01:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-31 22:01:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:24,626 INFO L225 Difference]: With dead ends: 54 [2024-10-31 22:01:24,627 INFO L226 Difference]: Without dead ends: 38 [2024-10-31 22:01:24,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:24,627 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:24,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 77 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:01:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-31 22:01:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-31 22:01:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-31 22:01:24,632 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 19 [2024-10-31 22:01:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:24,632 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-31 22:01:24,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-31 22:01:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:01:24,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:24,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] [2024-10-31 22:01:24,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:01:24,633 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:24,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1677981515, now seen corresponding path program 1 times [2024-10-31 22:01:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:24,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601789518] [2024-10-31 22:01:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:24,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:24,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:24,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601789518] [2024-10-31 22:01:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601789518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:24,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:24,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:01:24,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186546695] [2024-10-31 22:01:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:24,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:01:24,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:01:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:01:24,885 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:25,017 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-10-31 22:01:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:01:25,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-31 22:01:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:25,019 INFO L225 Difference]: With dead ends: 58 [2024-10-31 22:01:25,019 INFO L226 Difference]: Without dead ends: 58 [2024-10-31 22:01:25,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:01:25,020 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:25,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-31 22:01:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-10-31 22:01:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-10-31 22:01:25,028 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 19 [2024-10-31 22:01:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:25,028 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-10-31 22:01:25,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-10-31 22:01:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:01:25,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:25,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:25,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:01:25,029 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:25,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash 656913161, now seen corresponding path program 1 times [2024-10-31 22:01:25,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:25,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92896620] [2024-10-31 22:01:25,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:25,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:25,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:25,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92896620] [2024-10-31 22:01:25,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92896620] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:01:25,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633582331] [2024-10-31 22:01:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:25,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:01:25,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:25,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:01:25,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:01:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:25,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-31 22:01:25,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:25,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-31 22:01:25,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-31 22:01:26,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:01:26,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-10-31 22:01:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:26,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:01:26,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-31 22:01:26,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-31 22:01:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:26,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633582331] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:01:26,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:01:26,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2024-10-31 22:01:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072948599] [2024-10-31 22:01:26,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:01:26,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-31 22:01:26,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:26,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-31 22:01:26,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2024-10-31 22:01:26,833 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:29,633 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-10-31 22:01:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:01:29,634 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-31 22:01:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:29,634 INFO L225 Difference]: With dead ends: 63 [2024-10-31 22:01:29,635 INFO L226 Difference]: Without dead ends: 63 [2024-10-31 22:01:29,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=234, Invalid=955, Unknown=1, NotChecked=0, Total=1190 [2024-10-31 22:01:29,636 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 191 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:29,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 177 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:01:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-31 22:01:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2024-10-31 22:01:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.2) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2024-10-31 22:01:29,639 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 19 [2024-10-31 22:01:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:29,640 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-10-31 22:01:29,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2024-10-31 22:01:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:01:29,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:29,644 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] [2024-10-31 22:01:29,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:01:29,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-31 22:01:29,849 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:29,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash 658274998, now seen corresponding path program 1 times [2024-10-31 22:01:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986722582] [2024-10-31 22:01:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:30,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:30,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986722582] [2024-10-31 22:01:30,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986722582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:01:30,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082270018] [2024-10-31 22:01:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:30,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:01:30,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:30,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:01:30,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:01:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:30,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-31 22:01:30,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:30,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-31 22:01:30,594 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-31 22:01:30,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-10-31 22:01:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:30,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:01:31,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-31 22:01:31,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-31 22:01:31,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-31 22:01:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:31,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082270018] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:01:31,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:01:31,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 24 [2024-10-31 22:01:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127602811] [2024-10-31 22:01:31,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:01:31,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-31 22:01:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:31,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-31 22:01:31,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2024-10-31 22:01:31,245 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:32,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:32,844 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-10-31 22:01:32,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-31 22:01:32,845 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-31 22:01:32,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:32,846 INFO L225 Difference]: With dead ends: 80 [2024-10-31 22:01:32,846 INFO L226 Difference]: Without dead ends: 54 [2024-10-31 22:01:32,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2024-10-31 22:01:32,848 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 160 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:32,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 94 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:01:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-31 22:01:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 30. [2024-10-31 22:01:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-10-31 22:01:32,850 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2024-10-31 22:01:32,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:32,850 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-10-31 22:01:32,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-10-31 22:01:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:01:32,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:32,851 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:32,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 22:01:33,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:01:33,053 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-31 22:01:33,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1423532355, now seen corresponding path program 2 times [2024-10-31 22:01:33,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:33,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504797042] [2024-10-31 22:01:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:33,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:33,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504797042] [2024-10-31 22:01:33,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504797042] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:01:33,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207712769] [2024-10-31 22:01:33,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:01:33,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:01:33,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:33,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:01:33,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcd2b7e-481a-4dbb-aeca-d51fdbb9bebd/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 22:01:33,902 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:01:33,903 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:01:33,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-31 22:01:33,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:33,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-31 22:01:33,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-31 22:01:35,009 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-31 22:01:35,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2024-10-31 22:01:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:35,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:01:35,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-10-31 22:01:35,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-31 22:01:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207712769] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:01:35,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:01:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 34 [2024-10-31 22:01:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756709374] [2024-10-31 22:01:35,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:01:35,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-31 22:01:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-31 22:01:35,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1065, Unknown=1, NotChecked=0, Total=1190 [2024-10-31 22:01:36,001 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:41,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-31 22:01:44,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-31 22:01:45,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]