./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:00:43,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:00:43,924 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 15:00:43,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:00:43,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:00:43,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:00:43,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:00:43,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:00:43,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:00:43,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:00:43,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:00:43,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:00:43,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:00:43,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:00:43,972 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:00:43,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:00:43,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:00:43,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:00:43,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:00:43,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:00:43,973 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:00:43,973 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:00:43,973 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:00:43,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:00:43,973 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:00:43,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:00:43,974 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:00:43,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:00:43,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:00:43,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:00:43,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:00:43,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:00:43,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:00:43,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:00:43,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:00:43,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:00:43,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:00:43,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:00:43,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:00:43,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:00:43,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:00:43,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:00:43,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2024-11-13 15:00:44,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:00:44,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:00:44,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:00:44,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:00:44,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:00:44,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/forester-heap/sll-01-2.i Unable to find full path for "g++" [2024-11-13 15:00:46,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:00:46,490 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:00:46,490 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/sv-benchmarks/c/forester-heap/sll-01-2.i [2024-11-13 15:00:46,510 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/data/b1c081b1e/a9a1d137fdab415c81920bec662acd45/FLAG39cd8eaa5 [2024-11-13 15:00:46,536 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/data/b1c081b1e/a9a1d137fdab415c81920bec662acd45 [2024-11-13 15:00:46,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:00:46,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:00:46,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:00:46,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:00:46,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:00:46,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:00:46" (1/1) ... [2024-11-13 15:00:46,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338ba2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:46, skipping insertion in model container [2024-11-13 15:00:46,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:00:46" (1/1) ... [2024-11-13 15:00:46,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:00:46,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:00:47,010 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:00:47,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:00:47,128 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:00:47,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47 WrapperNode [2024-11-13 15:00:47,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:00:47,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:00:47,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:00:47,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:00:47,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,196 INFO L138 Inliner]: procedures = 119, calls = 55, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2024-11-13 15:00:47,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:00:47,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:00:47,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:00:47,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:00:47,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,245 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-11-13 15:00:47,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:00:47,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:00:47,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:00:47,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:00:47,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (1/1) ... [2024-11-13 15:00:47,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:00:47,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:00:47,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:00:47,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:00:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-13 15:00:47,356 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-13 15:00:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:00:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:00:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:00:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:00:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:00:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:00:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:00:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:00:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:00:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:00:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:00:47,516 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:00:47,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:00:48,249 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-13 15:00:48,250 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:00:48,271 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:00:48,272 INFO L316 CfgBuilder]: Removed 30 assume(true) statements. [2024-11-13 15:00:48,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:00:48 BoogieIcfgContainer [2024-11-13 15:00:48,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:00:48,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:00:48,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:00:48,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:00:48,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:00:46" (1/3) ... [2024-11-13 15:00:48,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570bdefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:00:48, skipping insertion in model container [2024-11-13 15:00:48,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:00:47" (2/3) ... [2024-11-13 15:00:48,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570bdefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:00:48, skipping insertion in model container [2024-11-13 15:00:48,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:00:48" (3/3) ... [2024-11-13 15:00:48,309 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2024-11-13 15:00:48,323 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:00:48,325 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-01-2.i that has 2 procedures, 200 locations, 1 initial locations, 17 loop locations, and 68 error locations. [2024-11-13 15:00:48,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:00:48,393 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;@52102c89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:00:48,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2024-11-13 15:00:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 117 states have (on average 2.051282051282051) internal successors, (240), 185 states have internal predecessors, (240), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-13 15:00:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 15:00:48,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:48,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 15:00:48,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:48,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:48,410 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-13 15:00:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:48,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779534207] [2024-11-13 15:00:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:48,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:48,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:48,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779534207] [2024-11-13 15:00:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779534207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:48,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:48,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:00:48,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771042515] [2024-11-13 15:00:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:48,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:00:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:48,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:00:48,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:00:48,654 INFO L87 Difference]: Start difference. First operand has 200 states, 117 states have (on average 2.051282051282051) internal successors, (240), 185 states have internal predecessors, (240), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:48,938 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2024-11-13 15:00:48,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:00:48,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-13 15:00:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:48,947 INFO L225 Difference]: With dead ends: 180 [2024-11-13 15:00:48,948 INFO L226 Difference]: Without dead ends: 178 [2024-11-13 15:00:48,950 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-11-13 15:00:48,953 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 160 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:48,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 129 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-13 15:00:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-13 15:00:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 105 states have (on average 1.8095238095238095) internal successors, (190), 176 states have internal predecessors, (190), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-13 15:00:49,015 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 3 [2024-11-13 15:00:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:49,016 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-13 15:00:49,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-13 15:00:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 15:00:49,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:49,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 15:00:49,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:00:49,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:49,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-13 15:00:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:49,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643727746] [2024-11-13 15:00:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:49,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643727746] [2024-11-13 15:00:49,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643727746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:49,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:49,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:00:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092847234] [2024-11-13 15:00:49,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:49,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:00:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:00:49,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:00:49,138 INFO L87 Difference]: Start difference. First operand 178 states and 203 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:49,351 INFO L93 Difference]: Finished difference Result 198 states and 227 transitions. [2024-11-13 15:00:49,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:00:49,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-13 15:00:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:49,353 INFO L225 Difference]: With dead ends: 198 [2024-11-13 15:00:49,353 INFO L226 Difference]: Without dead ends: 198 [2024-11-13 15:00:49,353 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-11-13 15:00:49,354 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 158 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:49,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 153 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-13 15:00:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2024-11-13 15:00:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 122 states have (on average 1.7295081967213115) internal successors, (211), 186 states have internal predecessors, (211), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2024-11-13 15:00:49,365 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 3 [2024-11-13 15:00:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:49,365 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2024-11-13 15:00:49,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2024-11-13 15:00:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 15:00:49,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:49,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:49,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:00:49,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:49,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1467441145, now seen corresponding path program 1 times [2024-11-13 15:00:49,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:49,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305768634] [2024-11-13 15:00:49,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:49,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:49,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305768634] [2024-11-13 15:00:49,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305768634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:49,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:49,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:00:49,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416784177] [2024-11-13 15:00:49,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:49,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:00:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:49,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:00:49,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:00:49,408 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:49,473 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2024-11-13 15:00:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:00:49,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-13 15:00:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:49,476 INFO L225 Difference]: With dead ends: 199 [2024-11-13 15:00:49,476 INFO L226 Difference]: Without dead ends: 199 [2024-11-13 15:00:49,477 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-11-13 15:00:49,477 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 161 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:49,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 215 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:00:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-13 15:00:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2024-11-13 15:00:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 122 states have (on average 1.7131147540983607) internal successors, (209), 185 states have internal predecessors, (209), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 221 transitions. [2024-11-13 15:00:49,496 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 221 transitions. Word has length 7 [2024-11-13 15:00:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:49,497 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 221 transitions. [2024-11-13 15:00:49,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 221 transitions. [2024-11-13 15:00:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:00:49,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:49,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:49,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:00:49,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:49,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:49,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1997087996, now seen corresponding path program 1 times [2024-11-13 15:00:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:49,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54388823] [2024-11-13 15:00:49,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:49,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:49,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:49,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54388823] [2024-11-13 15:00:49,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54388823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:49,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:49,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:00:49,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575977665] [2024-11-13 15:00:49,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:49,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:00:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:49,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:00:49,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:49,832 INFO L87 Difference]: Start difference. First operand 187 states and 221 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:50,067 INFO L93 Difference]: Finished difference Result 186 states and 220 transitions. [2024-11-13 15:00:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:50,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 15:00:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:50,069 INFO L225 Difference]: With dead ends: 186 [2024-11-13 15:00:50,069 INFO L226 Difference]: Without dead ends: 186 [2024-11-13 15:00:50,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:50,070 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 2 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:50,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 544 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-13 15:00:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-13 15:00:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 122 states have (on average 1.7049180327868851) internal successors, (208), 184 states have internal predecessors, (208), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2024-11-13 15:00:50,078 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 11 [2024-11-13 15:00:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:50,078 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2024-11-13 15:00:50,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2024-11-13 15:00:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:00:50,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:50,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:50,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:00:50,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:50,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1997087997, now seen corresponding path program 1 times [2024-11-13 15:00:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754357928] [2024-11-13 15:00:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754357928] [2024-11-13 15:00:50,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754357928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:50,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:50,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:00:50,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509370688] [2024-11-13 15:00:50,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:50,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:00:50,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:50,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:00:50,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:50,367 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:50,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:50,622 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2024-11-13 15:00:50,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:50,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 15:00:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:50,624 INFO L225 Difference]: With dead ends: 185 [2024-11-13 15:00:50,625 INFO L226 Difference]: Without dead ends: 185 [2024-11-13 15:00:50,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:50,626 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:50,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 555 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-13 15:00:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-13 15:00:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 122 states have (on average 1.6967213114754098) internal successors, (207), 183 states have internal predecessors, (207), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2024-11-13 15:00:50,644 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 11 [2024-11-13 15:00:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:50,645 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2024-11-13 15:00:50,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2024-11-13 15:00:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 15:00:50,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:50,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:50,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:00:50,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:50,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:50,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1031692412, now seen corresponding path program 1 times [2024-11-13 15:00:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:50,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481668935] [2024-11-13 15:00:50,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:50,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:50,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481668935] [2024-11-13 15:00:50,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481668935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:50,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:50,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:00:50,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955713776] [2024-11-13 15:00:50,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:50,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:00:50,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:50,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:00:50,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:00:50,686 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:50,704 INFO L93 Difference]: Finished difference Result 186 states and 220 transitions. [2024-11-13 15:00:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:00:50,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-13 15:00:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:50,708 INFO L225 Difference]: With dead ends: 186 [2024-11-13 15:00:50,708 INFO L226 Difference]: Without dead ends: 186 [2024-11-13 15:00:50,709 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-11-13 15:00:50,713 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:50,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:00:50,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-13 15:00:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-13 15:00:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 123 states have (on average 1.6910569105691058) internal successors, (208), 184 states have internal predecessors, (208), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2024-11-13 15:00:50,724 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 15 [2024-11-13 15:00:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:50,724 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2024-11-13 15:00:50,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2024-11-13 15:00:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:00:50,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:50,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:50,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:00:50,728 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:50,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1361526525, now seen corresponding path program 1 times [2024-11-13 15:00:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:50,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499127023] [2024-11-13 15:00:50,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:51,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:51,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499127023] [2024-11-13 15:00:51,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499127023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:51,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:51,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:00:51,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692013873] [2024-11-13 15:00:51,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:51,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:00:51,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:51,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:00:51,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:00:51,053 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:51,507 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2024-11-13 15:00:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:00:51,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 15:00:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:51,511 INFO L225 Difference]: With dead ends: 185 [2024-11-13 15:00:51,511 INFO L226 Difference]: Without dead ends: 185 [2024-11-13 15:00:51,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:00:51,512 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 158 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:51,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 530 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:00:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-13 15:00:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-13 15:00:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 123 states have (on average 1.6829268292682926) internal successors, (207), 183 states have internal predecessors, (207), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2024-11-13 15:00:51,522 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 14 [2024-11-13 15:00:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:51,522 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2024-11-13 15:00:51,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2024-11-13 15:00:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:00:51,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:51,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:51,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:00:51,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:51,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1361526526, now seen corresponding path program 1 times [2024-11-13 15:00:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:51,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323059879] [2024-11-13 15:00:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:51,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323059879] [2024-11-13 15:00:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323059879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:51,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:51,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:00:51,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617844685] [2024-11-13 15:00:51,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:51,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:00:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:00:51,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:00:51,940 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:52,381 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2024-11-13 15:00:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:00:52,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 15:00:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:52,383 INFO L225 Difference]: With dead ends: 184 [2024-11-13 15:00:52,384 INFO L226 Difference]: Without dead ends: 184 [2024-11-13 15:00:52,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:00:52,385 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 155 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:52,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 414 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:00:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-13 15:00:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-13 15:00:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 182 states have internal predecessors, (206), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2024-11-13 15:00:52,392 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 14 [2024-11-13 15:00:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:52,393 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2024-11-13 15:00:52,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2024-11-13 15:00:52,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 15:00:52,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:52,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:52,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:00:52,394 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:52,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1909214793, now seen corresponding path program 1 times [2024-11-13 15:00:52,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:52,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744188908] [2024-11-13 15:00:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:52,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:52,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:52,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744188908] [2024-11-13 15:00:52,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744188908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:52,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:52,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:00:52,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223007831] [2024-11-13 15:00:52,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:52,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:00:52,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:52,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:00:52,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:00:52,580 INFO L87 Difference]: Start difference. First operand 184 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:52,855 INFO L93 Difference]: Finished difference Result 265 states and 314 transitions. [2024-11-13 15:00:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:00:52,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 15:00:52,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:52,859 INFO L225 Difference]: With dead ends: 265 [2024-11-13 15:00:52,859 INFO L226 Difference]: Without dead ends: 265 [2024-11-13 15:00:52,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:00:52,860 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 88 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:52,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 764 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-13 15:00:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 182. [2024-11-13 15:00:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 122 states have (on average 1.6721311475409837) internal successors, (204), 180 states have internal predecessors, (204), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2024-11-13 15:00:52,869 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 17 [2024-11-13 15:00:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:52,869 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2024-11-13 15:00:52,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2024-11-13 15:00:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 15:00:52,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:52,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:52,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:00:52,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:52,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash 460257655, now seen corresponding path program 1 times [2024-11-13 15:00:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:52,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408421776] [2024-11-13 15:00:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:53,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408421776] [2024-11-13 15:00:53,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408421776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:53,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:53,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:00:53,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668383146] [2024-11-13 15:00:53,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:53,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:00:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:53,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:00:53,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:53,037 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-13 15:00:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:53,223 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2024-11-13 15:00:53,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:53,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-13 15:00:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:53,225 INFO L225 Difference]: With dead ends: 266 [2024-11-13 15:00:53,225 INFO L226 Difference]: Without dead ends: 266 [2024-11-13 15:00:53,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:00:53,226 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 87 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:53,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 609 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:00:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-13 15:00:53,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 185. [2024-11-13 15:00:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 125 states have (on average 1.656) internal successors, (207), 183 states have internal predecessors, (207), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 218 transitions. [2024-11-13 15:00:53,239 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 218 transitions. Word has length 17 [2024-11-13 15:00:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:53,239 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 218 transitions. [2024-11-13 15:00:53,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-11-13 15:00:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 218 transitions. [2024-11-13 15:00:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 15:00:53,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:53,240 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-11-13 15:00:53,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:00:53,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 583600892, now seen corresponding path program 1 times [2024-11-13 15:00:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478958212] [2024-11-13 15:00:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:53,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478958212] [2024-11-13 15:00:53,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478958212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:53,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:53,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:00:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840754486] [2024-11-13 15:00:53,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:53,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:00:53,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:53,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:00:53,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:00:53,356 INFO L87 Difference]: Start difference. First operand 185 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-13 15:00:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:53,557 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2024-11-13 15:00:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:00:53,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-13 15:00:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:53,559 INFO L225 Difference]: With dead ends: 176 [2024-11-13 15:00:53,559 INFO L226 Difference]: Without dead ends: 176 [2024-11-13 15:00:53,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:53,560 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 215 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:53,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 122 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-13 15:00:53,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-13 15:00:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 127 states have (on average 1.5590551181102361) internal successors, (198), 174 states have internal predecessors, (198), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 209 transitions. [2024-11-13 15:00:53,565 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 209 transitions. Word has length 19 [2024-11-13 15:00:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:53,565 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 209 transitions. [2024-11-13 15:00:53,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-13 15:00:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 209 transitions. [2024-11-13 15:00:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 15:00:53,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:53,566 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-11-13 15:00:53,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:00:53,567 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:53,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:53,567 INFO L85 PathProgramCache]: Analyzing trace with hash 583600893, now seen corresponding path program 1 times [2024-11-13 15:00:53,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:53,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021761718] [2024-11-13 15:00:53,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:53,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:53,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021761718] [2024-11-13 15:00:53,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021761718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:53,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:53,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:00:53,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255621540] [2024-11-13 15:00:53,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:53,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:00:53,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:53,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:00:53,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:00:53,706 INFO L87 Difference]: Start difference. First operand 176 states and 209 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-13 15:00:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:53,940 INFO L93 Difference]: Finished difference Result 221 states and 256 transitions. [2024-11-13 15:00:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:00:53,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-13 15:00:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:53,942 INFO L225 Difference]: With dead ends: 221 [2024-11-13 15:00:53,942 INFO L226 Difference]: Without dead ends: 221 [2024-11-13 15:00:53,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:53,943 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 212 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:53,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 204 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-13 15:00:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2024-11-13 15:00:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 151 states have (on average 1.5695364238410596) internal successors, (237), 198 states have internal predecessors, (237), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2024-11-13 15:00:53,956 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 19 [2024-11-13 15:00:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:53,956 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2024-11-13 15:00:53,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-11-13 15:00:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2024-11-13 15:00:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 15:00:53,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:53,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:53,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:00:53,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 871776735, now seen corresponding path program 1 times [2024-11-13 15:00:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:53,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355628684] [2024-11-13 15:00:53,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:53,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355628684] [2024-11-13 15:00:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355628684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:54,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:54,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:00:54,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644764347] [2024-11-13 15:00:54,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:00:54,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:54,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:00:54,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:00:54,010 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:54,136 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2024-11-13 15:00:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:00:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-13 15:00:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:54,138 INFO L225 Difference]: With dead ends: 222 [2024-11-13 15:00:54,138 INFO L226 Difference]: Without dead ends: 222 [2024-11-13 15:00:54,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:54,139 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 212 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:54,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 289 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:00:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-13 15:00:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2024-11-13 15:00:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 197 states have internal predecessors, (235), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 245 transitions. [2024-11-13 15:00:54,145 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 245 transitions. Word has length 23 [2024-11-13 15:00:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:54,145 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 245 transitions. [2024-11-13 15:00:54,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 245 transitions. [2024-11-13 15:00:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 15:00:54,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:54,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:54,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:00:54,146 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:54,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash 825650175, now seen corresponding path program 1 times [2024-11-13 15:00:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:54,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044829289] [2024-11-13 15:00:54,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:54,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:54,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044829289] [2024-11-13 15:00:54,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044829289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:54,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:54,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:00:54,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027911155] [2024-11-13 15:00:54,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:54,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:54,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:54,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:54,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:54,381 INFO L87 Difference]: Start difference. First operand 199 states and 245 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:54,660 INFO L93 Difference]: Finished difference Result 191 states and 237 transitions. [2024-11-13 15:00:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:00:54,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-13 15:00:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:54,662 INFO L225 Difference]: With dead ends: 191 [2024-11-13 15:00:54,662 INFO L226 Difference]: Without dead ends: 191 [2024-11-13 15:00:54,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:00:54,663 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 35 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:54,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 511 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-13 15:00:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2024-11-13 15:00:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.5068493150684932) internal successors, (220), 183 states have internal predecessors, (220), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 230 transitions. [2024-11-13 15:00:54,669 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 230 transitions. Word has length 23 [2024-11-13 15:00:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:54,669 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 230 transitions. [2024-11-13 15:00:54,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 230 transitions. [2024-11-13 15:00:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 15:00:54,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:54,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:54,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:00:54,671 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:54,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 825650174, now seen corresponding path program 1 times [2024-11-13 15:00:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:54,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90198844] [2024-11-13 15:00:54,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:54,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:54,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90198844] [2024-11-13 15:00:54,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90198844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:54,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:54,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:00:54,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179988965] [2024-11-13 15:00:54,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:54,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:54,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:54,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:54,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:54,792 INFO L87 Difference]: Start difference. First operand 185 states and 230 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:55,042 INFO L93 Difference]: Finished difference Result 188 states and 234 transitions. [2024-11-13 15:00:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:00:55,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-13 15:00:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:55,043 INFO L225 Difference]: With dead ends: 188 [2024-11-13 15:00:55,043 INFO L226 Difference]: Without dead ends: 188 [2024-11-13 15:00:55,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:00:55,044 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 77 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:55,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 426 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-13 15:00:55,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2024-11-13 15:00:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.5) internal successors, (219), 182 states have internal predecessors, (219), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 229 transitions. [2024-11-13 15:00:55,050 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 229 transitions. Word has length 23 [2024-11-13 15:00:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:55,050 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 229 transitions. [2024-11-13 15:00:55,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 229 transitions. [2024-11-13 15:00:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 15:00:55,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:55,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:55,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:00:55,052 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:55,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:55,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1741523505, now seen corresponding path program 1 times [2024-11-13 15:00:55,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:55,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796915750] [2024-11-13 15:00:55,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:55,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:55,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796915750] [2024-11-13 15:00:55,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796915750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:55,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:55,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:00:55,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519843164] [2024-11-13 15:00:55,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:55,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:00:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:55,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:00:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:55,176 INFO L87 Difference]: Start difference. First operand 184 states and 229 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:55,329 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2024-11-13 15:00:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:00:55,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 15:00:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:55,330 INFO L225 Difference]: With dead ends: 188 [2024-11-13 15:00:55,330 INFO L226 Difference]: Without dead ends: 188 [2024-11-13 15:00:55,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:00:55,331 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 34 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:55,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 632 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:00:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-13 15:00:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2024-11-13 15:00:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 146 states have (on average 1.4863013698630136) internal successors, (217), 180 states have internal predecessors, (217), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 225 transitions. [2024-11-13 15:00:55,339 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 225 transitions. Word has length 27 [2024-11-13 15:00:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:55,339 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 225 transitions. [2024-11-13 15:00:55,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2024-11-13 15:00:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 15:00:55,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:55,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:55,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:00:55,343 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:55,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:55,344 INFO L85 PathProgramCache]: Analyzing trace with hash 414817086, now seen corresponding path program 1 times [2024-11-13 15:00:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:55,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095475551] [2024-11-13 15:00:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:55,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:55,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095475551] [2024-11-13 15:00:55,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095475551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:55,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:55,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:00:55,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868149070] [2024-11-13 15:00:55,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:55,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:00:55,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:55,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:00:55,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:00:55,404 INFO L87 Difference]: Start difference. First operand 182 states and 225 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:55,422 INFO L93 Difference]: Finished difference Result 194 states and 239 transitions. [2024-11-13 15:00:55,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:00:55,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-13 15:00:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:55,424 INFO L225 Difference]: With dead ends: 194 [2024-11-13 15:00:55,424 INFO L226 Difference]: Without dead ends: 194 [2024-11-13 15:00:55,424 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-11-13 15:00:55,424 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 7 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:55,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 295 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:00:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-13 15:00:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2024-11-13 15:00:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 233 transitions. [2024-11-13 15:00:55,433 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 233 transitions. Word has length 29 [2024-11-13 15:00:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:55,434 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 233 transitions. [2024-11-13 15:00:55,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 233 transitions. [2024-11-13 15:00:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 15:00:55,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:55,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:55,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:00:55,437 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:55,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:55,438 INFO L85 PathProgramCache]: Analyzing trace with hash -49887470, now seen corresponding path program 1 times [2024-11-13 15:00:55,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:55,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604532916] [2024-11-13 15:00:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:55,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:55,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:55,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604532916] [2024-11-13 15:00:55,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604532916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:55,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:55,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:00:55,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100828137] [2024-11-13 15:00:55,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:55,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:00:55,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:55,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:00:55,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:00:55,497 INFO L87 Difference]: Start difference. First operand 188 states and 233 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:55,532 INFO L93 Difference]: Finished difference Result 187 states and 230 transitions. [2024-11-13 15:00:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:00:55,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-13 15:00:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:55,533 INFO L225 Difference]: With dead ends: 187 [2024-11-13 15:00:55,534 INFO L226 Difference]: Without dead ends: 187 [2024-11-13 15:00:55,534 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-11-13 15:00:55,535 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 11 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:55,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 267 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:00:55,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-13 15:00:55,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-13 15:00:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 230 transitions. [2024-11-13 15:00:55,542 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 230 transitions. Word has length 30 [2024-11-13 15:00:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:55,543 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 230 transitions. [2024-11-13 15:00:55,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 230 transitions. [2024-11-13 15:00:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 15:00:55,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:55,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:55,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:00:55,546 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:55,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:55,546 INFO L85 PathProgramCache]: Analyzing trace with hash 414030730, now seen corresponding path program 1 times [2024-11-13 15:00:55,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:55,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979777784] [2024-11-13 15:00:55,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:55,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:55,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:55,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979777784] [2024-11-13 15:00:55,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979777784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:55,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:55,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:00:55,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470887130] [2024-11-13 15:00:55,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:55,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:00:55,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:55,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:00:55,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:00:55,822 INFO L87 Difference]: Start difference. First operand 187 states and 230 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:56,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:56,261 INFO L93 Difference]: Finished difference Result 283 states and 343 transitions. [2024-11-13 15:00:56,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:00:56,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-13 15:00:56,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:56,263 INFO L225 Difference]: With dead ends: 283 [2024-11-13 15:00:56,263 INFO L226 Difference]: Without dead ends: 283 [2024-11-13 15:00:56,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:00:56,264 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 101 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:56,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 879 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:00:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-13 15:00:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 199. [2024-11-13 15:00:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 164 states have (on average 1.4390243902439024) internal successors, (236), 197 states have internal predecessors, (236), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 243 transitions. [2024-11-13 15:00:56,271 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 243 transitions. Word has length 29 [2024-11-13 15:00:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:56,271 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 243 transitions. [2024-11-13 15:00:56,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 243 transitions. [2024-11-13 15:00:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 15:00:56,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:56,272 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:56,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 15:00:56,272 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:56,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash -786860611, now seen corresponding path program 1 times [2024-11-13 15:00:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891541707] [2024-11-13 15:00:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891541707] [2024-11-13 15:00:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891541707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:00:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370981180] [2024-11-13 15:00:56,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:56,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:00:56,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:00:56,513 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:00:56,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:00:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:56,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 15:00:56,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:00:56,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:00:56,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:00:56,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 15:00:56,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 15:00:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:57,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:00:57,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-13 15:00:57,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-13 15:00:57,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-13 15:00:57,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:00:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:57,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370981180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:00:57,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:00:57,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-13 15:00:57,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148336721] [2024-11-13 15:00:57,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:00:57,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:00:57,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:57,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:00:57,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:00:57,900 INFO L87 Difference]: Start difference. First operand 199 states and 243 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:58,480 INFO L93 Difference]: Finished difference Result 325 states and 382 transitions. [2024-11-13 15:00:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:00:58,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-13 15:00:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:58,482 INFO L225 Difference]: With dead ends: 325 [2024-11-13 15:00:58,483 INFO L226 Difference]: Without dead ends: 325 [2024-11-13 15:00:58,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-13 15:00:58,486 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 750 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:58,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 748 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:00:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-13 15:00:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 230. [2024-11-13 15:00:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 195 states have (on average 1.4512820512820512) internal successors, (283), 228 states have internal predecessors, (283), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 290 transitions. [2024-11-13 15:00:58,497 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 290 transitions. Word has length 31 [2024-11-13 15:00:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:58,498 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 290 transitions. [2024-11-13 15:00:58,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 290 transitions. [2024-11-13 15:00:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 15:00:58,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:58,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:58,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:00:58,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:00:58,704 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:58,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:58,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1066684684, now seen corresponding path program 1 times [2024-11-13 15:00:58,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:58,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227324615] [2024-11-13 15:00:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:58,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:58,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:58,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227324615] [2024-11-13 15:00:58,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227324615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:58,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:58,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:00:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764129056] [2024-11-13 15:00:58,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:58,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:00:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:58,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:00:58,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:58,829 INFO L87 Difference]: Start difference. First operand 230 states and 290 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:59,021 INFO L93 Difference]: Finished difference Result 229 states and 289 transitions. [2024-11-13 15:00:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:59,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-13 15:00:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:59,023 INFO L225 Difference]: With dead ends: 229 [2024-11-13 15:00:59,023 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 15:00:59,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:59,025 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 2 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:59,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 434 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 15:00:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-13 15:00:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 195 states have (on average 1.4461538461538461) internal successors, (282), 227 states have internal predecessors, (282), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 289 transitions. [2024-11-13 15:00:59,032 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 289 transitions. Word has length 33 [2024-11-13 15:00:59,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:59,032 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 289 transitions. [2024-11-13 15:00:59,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 289 transitions. [2024-11-13 15:00:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 15:00:59,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:59,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:59,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 15:00:59,033 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:59,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1066684683, now seen corresponding path program 1 times [2024-11-13 15:00:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105230436] [2024-11-13 15:00:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:00:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:59,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:00:59,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105230436] [2024-11-13 15:00:59,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105230436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:00:59,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:00:59,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:00:59,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385769503] [2024-11-13 15:00:59,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:00:59,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:00:59,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:00:59,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:00:59,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:00:59,263 INFO L87 Difference]: Start difference. First operand 229 states and 289 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:00:59,461 INFO L93 Difference]: Finished difference Result 228 states and 288 transitions. [2024-11-13 15:00:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:00:59,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-13 15:00:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:00:59,463 INFO L225 Difference]: With dead ends: 228 [2024-11-13 15:00:59,463 INFO L226 Difference]: Without dead ends: 228 [2024-11-13 15:00:59,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:00:59,465 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:00:59,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:00:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-13 15:00:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-13 15:00:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 195 states have (on average 1.441025641025641) internal successors, (281), 226 states have internal predecessors, (281), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 288 transitions. [2024-11-13 15:00:59,472 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 288 transitions. Word has length 33 [2024-11-13 15:00:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:00:59,472 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 288 transitions. [2024-11-13 15:00:59,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:00:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 288 transitions. [2024-11-13 15:00:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 15:00:59,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:00:59,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:00:59,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 15:00:59,474 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:00:59,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:00:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash -349980613, now seen corresponding path program 1 times [2024-11-13 15:00:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:00:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525790270] [2024-11-13 15:00:59,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:00:59,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:00:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:01:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525790270] [2024-11-13 15:01:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525790270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:00,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:00,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:01:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226481066] [2024-11-13 15:01:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:00,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:01:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:00,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:01:00,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:01:00,072 INFO L87 Difference]: Start difference. First operand 228 states and 288 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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-11-13 15:01:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:00,988 INFO L93 Difference]: Finished difference Result 291 states and 344 transitions. [2024-11-13 15:01:00,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:01:00,989 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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) Word has length 34 [2024-11-13 15:01:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:00,990 INFO L225 Difference]: With dead ends: 291 [2024-11-13 15:01:00,990 INFO L226 Difference]: Without dead ends: 291 [2024-11-13 15:01:00,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2024-11-13 15:01:00,991 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 560 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:00,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 874 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:01:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-13 15:01:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 229. [2024-11-13 15:01:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 198 states have (on average 1.4090909090909092) internal successors, (279), 227 states have internal predecessors, (279), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 286 transitions. [2024-11-13 15:01:00,999 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 286 transitions. Word has length 34 [2024-11-13 15:01:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:00,999 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 286 transitions. [2024-11-13 15:01:00,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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-11-13 15:01:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 286 transitions. [2024-11-13 15:01:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 15:01:01,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:01,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:01,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 15:01:01,000 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:01,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -349980612, now seen corresponding path program 1 times [2024-11-13 15:01:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:01,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537332792] [2024-11-13 15:01:01,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:01,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:01:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:01,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537332792] [2024-11-13 15:01:01,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537332792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:01,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:01,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:01:01,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030241141] [2024-11-13 15:01:01,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:01,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:01:01,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:01:01,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:01:01,528 INFO L87 Difference]: Start difference. First operand 229 states and 286 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 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-11-13 15:01:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:02,386 INFO L93 Difference]: Finished difference Result 306 states and 358 transitions. [2024-11-13 15:01:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:01:02,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 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) Word has length 34 [2024-11-13 15:01:02,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:02,388 INFO L225 Difference]: With dead ends: 306 [2024-11-13 15:01:02,388 INFO L226 Difference]: Without dead ends: 306 [2024-11-13 15:01:02,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:01:02,389 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 422 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:02,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 895 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:01:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-13 15:01:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 235. [2024-11-13 15:01:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.4019607843137254) internal successors, (286), 233 states have internal predecessors, (286), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 293 transitions. [2024-11-13 15:01:02,397 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 293 transitions. Word has length 34 [2024-11-13 15:01:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:02,397 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 293 transitions. [2024-11-13 15:01:02,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 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-11-13 15:01:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 293 transitions. [2024-11-13 15:01:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 15:01:02,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:02,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:02,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 15:01:02,399 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:02,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash 592628399, now seen corresponding path program 1 times [2024-11-13 15:01:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24709829] [2024-11-13 15:01:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:01:02,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24709829] [2024-11-13 15:01:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24709829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:02,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:01:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518477955] [2024-11-13 15:01:02,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:02,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:01:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:02,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:01:02,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:01:02,459 INFO L87 Difference]: Start difference. First operand 235 states and 293 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:02,474 INFO L93 Difference]: Finished difference Result 236 states and 294 transitions. [2024-11-13 15:01:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:01:02,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-13 15:01:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:02,476 INFO L225 Difference]: With dead ends: 236 [2024-11-13 15:01:02,476 INFO L226 Difference]: Without dead ends: 236 [2024-11-13 15:01:02,476 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-11-13 15:01:02,476 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:02,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:01:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-13 15:01:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-11-13 15:01:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 205 states have (on average 1.4) internal successors, (287), 234 states have internal predecessors, (287), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 294 transitions. [2024-11-13 15:01:02,484 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 294 transitions. Word has length 37 [2024-11-13 15:01:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:02,484 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 294 transitions. [2024-11-13 15:01:02,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 294 transitions. [2024-11-13 15:01:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:01:02,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:02,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:02,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 15:01:02,486 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:02,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash 859738136, now seen corresponding path program 1 times [2024-11-13 15:01:02,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:02,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894408526] [2024-11-13 15:01:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:01:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:02,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894408526] [2024-11-13 15:01:02,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894408526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:02,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:02,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:01:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186602120] [2024-11-13 15:01:02,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:02,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:01:02,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:02,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:01:02,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:01:02,798 INFO L87 Difference]: Start difference. First operand 236 states and 294 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:03,205 INFO L93 Difference]: Finished difference Result 236 states and 294 transitions. [2024-11-13 15:01:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:01:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 15:01:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:03,206 INFO L225 Difference]: With dead ends: 236 [2024-11-13 15:01:03,207 INFO L226 Difference]: Without dead ends: 236 [2024-11-13 15:01:03,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:01:03,207 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 69 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:03,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 655 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:01:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-13 15:01:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2024-11-13 15:01:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 205 states have (on average 1.395121951219512) internal successors, (286), 233 states have internal predecessors, (286), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 293 transitions. [2024-11-13 15:01:03,213 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 293 transitions. Word has length 36 [2024-11-13 15:01:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:03,214 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 293 transitions. [2024-11-13 15:01:03,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 293 transitions. [2024-11-13 15:01:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:01:03,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:03,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:03,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 15:01:03,215 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:03,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:03,215 INFO L85 PathProgramCache]: Analyzing trace with hash 859738137, now seen corresponding path program 1 times [2024-11-13 15:01:03,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:03,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554396852] [2024-11-13 15:01:03,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:03,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:01:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:03,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554396852] [2024-11-13 15:01:03,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554396852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:03,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:03,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:01:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045730673] [2024-11-13 15:01:03,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:03,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:01:03,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:01:03,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:01:03,640 INFO L87 Difference]: Start difference. First operand 235 states and 293 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:04,120 INFO L93 Difference]: Finished difference Result 235 states and 293 transitions. [2024-11-13 15:01:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:01:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-13 15:01:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:04,121 INFO L225 Difference]: With dead ends: 235 [2024-11-13 15:01:04,121 INFO L226 Difference]: Without dead ends: 235 [2024-11-13 15:01:04,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:01:04,122 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:04,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 742 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:01:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-13 15:01:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2024-11-13 15:01:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 205 states have (on average 1.3902439024390243) internal successors, (285), 232 states have internal predecessors, (285), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2024-11-13 15:01:04,131 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 36 [2024-11-13 15:01:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:04,131 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2024-11-13 15:01:04,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2024-11-13 15:01:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 15:01:04,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:04,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:04,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 15:01:04,134 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:04,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1446322889, now seen corresponding path program 1 times [2024-11-13 15:01:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:04,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295858350] [2024-11-13 15:01:04,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:04,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:01:04,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:04,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295858350] [2024-11-13 15:01:04,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295858350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:04,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:04,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:01:04,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406663847] [2024-11-13 15:01:04,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:04,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:01:04,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:04,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:01:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:01:04,282 INFO L87 Difference]: Start difference. First operand 234 states and 292 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:04,507 INFO L93 Difference]: Finished difference Result 247 states and 305 transitions. [2024-11-13 15:01:04,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:01:04,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-13 15:01:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:04,509 INFO L225 Difference]: With dead ends: 247 [2024-11-13 15:01:04,509 INFO L226 Difference]: Without dead ends: 247 [2024-11-13 15:01:04,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:01:04,510 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 16 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:04,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 555 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:01:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-13 15:01:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2024-11-13 15:01:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 214 states have (on average 1.3738317757009346) internal successors, (294), 241 states have internal predecessors, (294), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 301 transitions. [2024-11-13 15:01:04,519 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 301 transitions. Word has length 38 [2024-11-13 15:01:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:04,519 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 301 transitions. [2024-11-13 15:01:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 301 transitions. [2024-11-13 15:01:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 15:01:04,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:04,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:04,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 15:01:04,521 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:04,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:04,521 INFO L85 PathProgramCache]: Analyzing trace with hash -968999818, now seen corresponding path program 1 times [2024-11-13 15:01:04,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:04,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511810173] [2024-11-13 15:01:04,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:04,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:01:05,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:05,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511810173] [2024-11-13 15:01:05,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511810173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:05,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:05,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:01:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939377178] [2024-11-13 15:01:05,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:05,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:01:05,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:05,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:01:05,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:01:05,498 INFO L87 Difference]: Start difference. First operand 243 states and 301 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:06,956 INFO L93 Difference]: Finished difference Result 423 states and 498 transitions. [2024-11-13 15:01:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 15:01:06,957 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-13 15:01:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:06,959 INFO L225 Difference]: With dead ends: 423 [2024-11-13 15:01:06,959 INFO L226 Difference]: Without dead ends: 423 [2024-11-13 15:01:06,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2024-11-13 15:01:06,960 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 716 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:06,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1054 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:01:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-13 15:01:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 277. [2024-11-13 15:01:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 248 states have (on average 1.346774193548387) internal successors, (334), 275 states have internal predecessors, (334), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 341 transitions. [2024-11-13 15:01:06,970 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 341 transitions. Word has length 38 [2024-11-13 15:01:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:06,970 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 341 transitions. [2024-11-13 15:01:06,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 341 transitions. [2024-11-13 15:01:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 15:01:06,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:06,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:06,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 15:01:06,971 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:06,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1383543208, now seen corresponding path program 1 times [2024-11-13 15:01:06,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:06,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253592176] [2024-11-13 15:01:06,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:06,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:01:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:07,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253592176] [2024-11-13 15:01:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253592176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:07,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:01:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422656621] [2024-11-13 15:01:07,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:01:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:07,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:01:07,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:01:07,010 INFO L87 Difference]: Start difference. First operand 277 states and 341 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:07,071 INFO L93 Difference]: Finished difference Result 286 states and 345 transitions. [2024-11-13 15:01:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:01:07,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-13 15:01:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:07,073 INFO L225 Difference]: With dead ends: 286 [2024-11-13 15:01:07,073 INFO L226 Difference]: Without dead ends: 286 [2024-11-13 15:01:07,073 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-11-13 15:01:07,074 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 91 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:07,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 153 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:01:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-13 15:01:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 278. [2024-11-13 15:01:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 276 states have internal predecessors, (335), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2024-11-13 15:01:07,082 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 38 [2024-11-13 15:01:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:07,083 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2024-11-13 15:01:07,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2024-11-13 15:01:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 15:01:07,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:07,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:07,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 15:01:07,084 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:07,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:07,089 INFO L85 PathProgramCache]: Analyzing trace with hash -382486060, now seen corresponding path program 1 times [2024-11-13 15:01:07,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:07,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552338601] [2024-11-13 15:01:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:01:07,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:07,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552338601] [2024-11-13 15:01:07,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552338601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:07,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:07,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:01:07,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739189097] [2024-11-13 15:01:07,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:07,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:01:07,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:07,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:01:07,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:01:07,245 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:07,480 INFO L93 Difference]: Finished difference Result 288 states and 352 transitions. [2024-11-13 15:01:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:01:07,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 15:01:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:07,481 INFO L225 Difference]: With dead ends: 288 [2024-11-13 15:01:07,481 INFO L226 Difference]: Without dead ends: 288 [2024-11-13 15:01:07,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:01:07,482 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 11 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:07,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 683 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:01:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-13 15:01:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 275. [2024-11-13 15:01:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 273 states have internal predecessors, (331), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 337 transitions. [2024-11-13 15:01:07,489 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 337 transitions. Word has length 39 [2024-11-13 15:01:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:07,490 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 337 transitions. [2024-11-13 15:01:07,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 337 transitions. [2024-11-13 15:01:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 15:01:07,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:07,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:07,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 15:01:07,491 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:07,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1998057617, now seen corresponding path program 1 times [2024-11-13 15:01:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:07,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192139032] [2024-11-13 15:01:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:01:08,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:08,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192139032] [2024-11-13 15:01:08,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192139032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:08,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:08,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:01:08,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341503909] [2024-11-13 15:01:08,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:08,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:01:08,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:08,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:01:08,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:01:08,335 INFO L87 Difference]: Start difference. First operand 275 states and 337 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:09,253 INFO L93 Difference]: Finished difference Result 348 states and 403 transitions. [2024-11-13 15:01:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:01:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-13 15:01:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:09,256 INFO L225 Difference]: With dead ends: 348 [2024-11-13 15:01:09,256 INFO L226 Difference]: Without dead ends: 348 [2024-11-13 15:01:09,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2024-11-13 15:01:09,257 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 506 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:09,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 973 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:01:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-13 15:01:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 275. [2024-11-13 15:01:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 273 states have internal predecessors, (330), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 336 transitions. [2024-11-13 15:01:09,270 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 336 transitions. Word has length 41 [2024-11-13 15:01:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:09,270 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 336 transitions. [2024-11-13 15:01:09,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 336 transitions. [2024-11-13 15:01:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 15:01:09,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:09,273 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:09,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 15:01:09,273 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:09,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1665896195, now seen corresponding path program 1 times [2024-11-13 15:01:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:09,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624873669] [2024-11-13 15:01:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:09,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:01:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624873669] [2024-11-13 15:01:09,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624873669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550465403] [2024-11-13 15:01:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:09,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:09,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:01:09,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:01:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:09,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 15:01:09,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:09,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:01:09,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:01:09,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 15:01:09,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 15:01:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:01:09,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:01:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550465403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:01:10,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:01:10,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2024-11-13 15:01:10,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527080460] [2024-11-13 15:01:10,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:01:10,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:01:10,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:10,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:01:10,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:01:10,077 INFO L87 Difference]: Start difference. First operand 275 states and 336 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:10,668 INFO L93 Difference]: Finished difference Result 384 states and 450 transitions. [2024-11-13 15:01:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:01:10,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-13 15:01:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:10,670 INFO L225 Difference]: With dead ends: 384 [2024-11-13 15:01:10,670 INFO L226 Difference]: Without dead ends: 384 [2024-11-13 15:01:10,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:01:10,671 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 152 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:10,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 938 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:01:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-13 15:01:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 299. [2024-11-13 15:01:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 271 states have (on average 1.3468634686346863) internal successors, (365), 297 states have internal predecessors, (365), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 371 transitions. [2024-11-13 15:01:10,679 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 371 transitions. Word has length 41 [2024-11-13 15:01:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:10,679 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 371 transitions. [2024-11-13 15:01:10,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 371 transitions. [2024-11-13 15:01:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 15:01:10,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:10,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:10,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:01:10,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-13 15:01:10,883 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:10,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash 103175685, now seen corresponding path program 1 times [2024-11-13 15:01:10,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:10,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351421085] [2024-11-13 15:01:10,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:01:10,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:10,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351421085] [2024-11-13 15:01:10,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351421085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:01:10,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140107965] [2024-11-13 15:01:10,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:10,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:01:10,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:01:10,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:01:10,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:01:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:11,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:01:11,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:01:11,176 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 13 treesize of output 9 [2024-11-13 15:01:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:01:11,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:01:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:01:11,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140107965] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:01:11,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:01:11,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-13 15:01:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284364952] [2024-11-13 15:01:11,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:01:11,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:01:11,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:11,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:01:11,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:01:11,321 INFO L87 Difference]: Start difference. First operand 299 states and 371 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:11,487 INFO L93 Difference]: Finished difference Result 330 states and 402 transitions. [2024-11-13 15:01:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:01:11,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-13 15:01:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:11,489 INFO L225 Difference]: With dead ends: 330 [2024-11-13 15:01:11,489 INFO L226 Difference]: Without dead ends: 306 [2024-11-13 15:01:11,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:01:11,490 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:11,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:01:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-13 15:01:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-13 15:01:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 278 states have (on average 1.3381294964028776) internal successors, (372), 304 states have internal predecessors, (372), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 378 transitions. [2024-11-13 15:01:11,498 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 378 transitions. Word has length 42 [2024-11-13 15:01:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:11,498 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 378 transitions. [2024-11-13 15:01:11,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:11,498 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 378 transitions. [2024-11-13 15:01:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 15:01:11,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:11,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:11,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:01:11,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-13 15:01:11,703 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 725317542, now seen corresponding path program 1 times [2024-11-13 15:01:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842784702] [2024-11-13 15:01:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:01:11,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842784702] [2024-11-13 15:01:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842784702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:11,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:11,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:01:11,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655479182] [2024-11-13 15:01:11,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:11,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:01:11,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:11,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:01:11,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:01:11,745 INFO L87 Difference]: Start difference. First operand 306 states and 378 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:11,810 INFO L93 Difference]: Finished difference Result 305 states and 374 transitions. [2024-11-13 15:01:11,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:01:11,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-13 15:01:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:11,811 INFO L225 Difference]: With dead ends: 305 [2024-11-13 15:01:11,811 INFO L226 Difference]: Without dead ends: 305 [2024-11-13 15:01:11,811 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-11-13 15:01:11,812 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 72 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:11,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 173 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:01:11,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-13 15:01:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-13 15:01:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 278 states have (on average 1.3273381294964028) internal successors, (369), 303 states have internal predecessors, (369), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 374 transitions. [2024-11-13 15:01:11,820 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 374 transitions. Word has length 43 [2024-11-13 15:01:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:11,820 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 374 transitions. [2024-11-13 15:01:11,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2024-11-13 15:01:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 15:01:11,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:11,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:11,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 15:01:11,822 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:11,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:11,822 INFO L85 PathProgramCache]: Analyzing trace with hash -946432610, now seen corresponding path program 1 times [2024-11-13 15:01:11,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:11,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761307318] [2024-11-13 15:01:11,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:11,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:01:12,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761307318] [2024-11-13 15:01:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761307318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:12,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:12,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:01:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828655531] [2024-11-13 15:01:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:12,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:01:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:01:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:01:12,088 INFO L87 Difference]: Start difference. First operand 305 states and 374 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:12,528 INFO L93 Difference]: Finished difference Result 339 states and 405 transitions. [2024-11-13 15:01:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:01:12,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-13 15:01:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:12,530 INFO L225 Difference]: With dead ends: 339 [2024-11-13 15:01:12,530 INFO L226 Difference]: Without dead ends: 339 [2024-11-13 15:01:12,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:01:12,531 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 423 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:12,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 436 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:01:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-13 15:01:12,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 312. [2024-11-13 15:01:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 285 states have (on average 1.3263157894736841) internal successors, (378), 310 states have internal predecessors, (378), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 383 transitions. [2024-11-13 15:01:12,546 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 383 transitions. Word has length 42 [2024-11-13 15:01:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:12,547 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 383 transitions. [2024-11-13 15:01:12,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 383 transitions. [2024-11-13 15:01:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 15:01:12,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:12,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:12,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 15:01:12,548 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:12,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:12,549 INFO L85 PathProgramCache]: Analyzing trace with hash -946432609, now seen corresponding path program 1 times [2024-11-13 15:01:12,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:12,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895039486] [2024-11-13 15:01:12,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:12,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:01:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:01:12,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:01:12,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895039486] [2024-11-13 15:01:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895039486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:01:12,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:01:12,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:01:12,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794418998] [2024-11-13 15:01:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:01:12,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:01:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:01:12,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:01:12,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:01:12,926 INFO L87 Difference]: Start difference. First operand 312 states and 383 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:01:13,463 INFO L93 Difference]: Finished difference Result 337 states and 404 transitions. [2024-11-13 15:01:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:01:13,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-13 15:01:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:01:13,465 INFO L225 Difference]: With dead ends: 337 [2024-11-13 15:01:13,465 INFO L226 Difference]: Without dead ends: 337 [2024-11-13 15:01:13,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:01:13,465 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 308 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:01:13,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 514 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:01:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-13 15:01:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 318. [2024-11-13 15:01:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 291 states have (on average 1.3230240549828178) internal successors, (385), 316 states have internal predecessors, (385), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 390 transitions. [2024-11-13 15:01:13,473 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 390 transitions. Word has length 42 [2024-11-13 15:01:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:01:13,474 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 390 transitions. [2024-11-13 15:01:13,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:01:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 390 transitions. [2024-11-13 15:01:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 15:01:13,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:01:13,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:13,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 15:01:13,475 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-13 15:01:13,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:01:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash 258271281, now seen corresponding path program 1 times [2024-11-13 15:01:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:01:13,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095798094] [2024-11-13 15:01:13,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:01:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:01:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:01:13,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:01:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:01:13,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:01:13,541 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:01:13,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 68 remaining) [2024-11-13 15:01:13,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (66 of 68 remaining) [2024-11-13 15:01:13,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 68 remaining) [2024-11-13 15:01:13,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 68 remaining) [2024-11-13 15:01:13,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 68 remaining) [2024-11-13 15:01:13,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 68 remaining) [2024-11-13 15:01:13,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 68 remaining) [2024-11-13 15:01:13,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 68 remaining) [2024-11-13 15:01:13,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 68 remaining) [2024-11-13 15:01:13,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 68 remaining) [2024-11-13 15:01:13,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 68 remaining) [2024-11-13 15:01:13,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 68 remaining) [2024-11-13 15:01:13,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 68 remaining) [2024-11-13 15:01:13,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 68 remaining) [2024-11-13 15:01:13,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 68 remaining) [2024-11-13 15:01:13,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 68 remaining) [2024-11-13 15:01:13,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 68 remaining) [2024-11-13 15:01:13,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 68 remaining) [2024-11-13 15:01:13,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 68 remaining) [2024-11-13 15:01:13,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 68 remaining) [2024-11-13 15:01:13,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 68 remaining) [2024-11-13 15:01:13,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 68 remaining) [2024-11-13 15:01:13,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 68 remaining) [2024-11-13 15:01:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 68 remaining) [2024-11-13 15:01:13,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 68 remaining) [2024-11-13 15:01:13,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 68 remaining) [2024-11-13 15:01:13,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 68 remaining) [2024-11-13 15:01:13,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 68 remaining) [2024-11-13 15:01:13,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 68 remaining) [2024-11-13 15:01:13,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 68 remaining) [2024-11-13 15:01:13,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 68 remaining) [2024-11-13 15:01:13,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 68 remaining) [2024-11-13 15:01:13,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 68 remaining) [2024-11-13 15:01:13,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 68 remaining) [2024-11-13 15:01:13,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 68 remaining) [2024-11-13 15:01:13,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 68 remaining) [2024-11-13 15:01:13,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 68 remaining) [2024-11-13 15:01:13,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 68 remaining) [2024-11-13 15:01:13,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 68 remaining) [2024-11-13 15:01:13,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 68 remaining) [2024-11-13 15:01:13,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 68 remaining) [2024-11-13 15:01:13,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 68 remaining) [2024-11-13 15:01:13,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 68 remaining) [2024-11-13 15:01:13,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 68 remaining) [2024-11-13 15:01:13,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 68 remaining) [2024-11-13 15:01:13,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 68 remaining) [2024-11-13 15:01:13,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 68 remaining) [2024-11-13 15:01:13,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 68 remaining) [2024-11-13 15:01:13,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 68 remaining) [2024-11-13 15:01:13,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (8 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (7 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (6 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 68 remaining) [2024-11-13 15:01:13,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (3 of 68 remaining) [2024-11-13 15:01:13,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (2 of 68 remaining) [2024-11-13 15:01:13,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (1 of 68 remaining) [2024-11-13 15:01:13,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK (0 of 68 remaining) [2024-11-13 15:01:13,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 15:01:13,560 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:01:13,600 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:01:13,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:01:13 BoogieIcfgContainer [2024-11-13 15:01:13,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:01:13,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:01:13,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:01:13,606 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:01:13,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:00:48" (3/4) ... [2024-11-13 15:01:13,608 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 15:01:13,653 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 15:01:13,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:01:13,656 INFO L158 Benchmark]: Toolchain (without parser) took 27113.99ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 93.6MB in the beginning and 204.9MB in the end (delta: -111.3MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-11-13 15:01:13,656 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:01:13,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.73ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 75.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:01:13,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.28ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 73.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:01:13,658 INFO L158 Benchmark]: Boogie Preprocessor took 83.62ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 70.7MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:01:13,658 INFO L158 Benchmark]: RCFGBuilder took 989.30ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 38.9MB in the end (delta: 31.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:01:13,659 INFO L158 Benchmark]: TraceAbstraction took 25326.96ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 38.6MB in the beginning and 207.4MB in the end (delta: -168.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:01:13,659 INFO L158 Benchmark]: Witness Printer took 47.07ms. Allocated memory is still 268.4MB. Free memory was 207.4MB in the beginning and 204.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:01:13,660 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.73ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 75.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.28ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 73.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 83.62ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 70.7MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 989.30ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 38.9MB in the end (delta: 31.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 25326.96ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 38.6MB in the beginning and 207.4MB in the end (delta: -168.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 47.07ms. Allocated memory is still 268.4MB. Free memory was 207.4MB in the beginning and 204.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] inner->inner - UnprovableResult [Line: 992]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 200 locations, 68 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 38, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6038 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6038 mSDsluCounter, 18866 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13867 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9819 IncrementalHoareTripleChecker+Invalid, 10071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 4999 mSDtfsCounter, 9819 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=37, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 941 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1169 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1197 ConstructedInterpolants, 19 QuantifiedInterpolants, 11054 SizeOfPredicates, 12 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 43 InterpolantComputations, 34 PerfectInterpolantSequences, 16/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-13 15:01:13,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3fe767b-a4fd-4fb2-a2f1-6b8834cb3bef/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)