./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 17:01:32,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 17:01:32,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-22 17:01:32,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 17:01:32,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 17:01:32,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 17:01:32,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 17:01:32,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 17:01:32,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 17:01:32,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 17:01:32,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 17:01:32,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 17:01:32,558 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 17:01:32,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 17:01:32,560 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 17:01:32,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 17:01:32,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 17:01:32,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 17:01:32,561 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 17:01:32,561 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 17:01:32,561 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 17:01:32,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 17:01:32,562 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 17:01:32,562 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 17:01:32,563 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 17:01:32,563 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 17:01:32,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 17:01:32,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 17:01:32,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 17:01:32,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 17:01:32,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:01:32,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 17:01:32,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 17:01:32,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 17:01:32,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 17:01:32,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 17:01:32,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 17:01:32,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 17:01:32,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 17:01:32,567 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 17:01:32,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 17:01:32,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 17:01:32,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 17:01:32,904 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 17:01:32,904 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 17:01:32,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i [2023-11-22 17:01:34,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 17:01:34,411 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 17:01:34,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i [2023-11-22 17:01:34,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0daf0564/2df575c3b6ce4fc3b84955c53a830d4e/FLAGdffeb9d7b [2023-11-22 17:01:34,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0daf0564/2df575c3b6ce4fc3b84955c53a830d4e [2023-11-22 17:01:34,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 17:01:34,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 17:01:34,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 17:01:34,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 17:01:34,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 17:01:34,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:01:34" (1/1) ... [2023-11-22 17:01:34,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29fbe6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:34, skipping insertion in model container [2023-11-22 17:01:34,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:01:34" (1/1) ... [2023-11-22 17:01:34,520 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:01:34,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:01:34,944 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 17:01:35,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:01:35,065 WARN L675 CHandler]: The function strncpy is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 17:01:35,073 INFO L206 MainTranslator]: Completed translation [2023-11-22 17:01:35,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35 WrapperNode [2023-11-22 17:01:35,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 17:01:35,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 17:01:35,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 17:01:35,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 17:01:35,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,170 INFO L138 Inliner]: procedures = 184, calls = 150, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 228 [2023-11-22 17:01:35,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 17:01:35,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 17:01:35,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 17:01:35,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 17:01:35,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,205 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,228 INFO L189 HeapSplitter]: Split 90 memory accesses to 3 slices as follows [19, 2, 69] [2023-11-22 17:01:35,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 17:01:35,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 17:01:35,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 17:01:35,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 17:01:35,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (1/1) ... [2023-11-22 17:01:35,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:01:35,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 17:01:35,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 17:01:35,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 17:01:35,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 17:01:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 17:01:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-22 17:01:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-22 17:01:35,383 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-22 17:01:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2023-11-22 17:01:35,384 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2023-11-22 17:01:35,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 17:01:35,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 17:01:35,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-22 17:01:35,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 17:01:35,385 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2023-11-22 17:01:35,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2023-11-22 17:01:35,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 17:01:35,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 17:01:35,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 17:01:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-22 17:01:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 17:01:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2023-11-22 17:01:35,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2023-11-22 17:01:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2023-11-22 17:01:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2023-11-22 17:01:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2023-11-22 17:01:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2023-11-22 17:01:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 17:01:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 17:01:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-22 17:01:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2023-11-22 17:01:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2023-11-22 17:01:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 17:01:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2023-11-22 17:01:35,391 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2023-11-22 17:01:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 17:01:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 17:01:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-22 17:01:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2023-11-22 17:01:35,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2023-11-22 17:01:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2023-11-22 17:01:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 17:01:35,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 17:01:35,611 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 17:01:35,613 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 17:01:36,307 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 17:01:36,377 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 17:01:36,378 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 17:01:36,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:01:36 BoogieIcfgContainer [2023-11-22 17:01:36,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 17:01:36,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 17:01:36,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 17:01:36,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 17:01:36,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:01:34" (1/3) ... [2023-11-22 17:01:36,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d994e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:01:36, skipping insertion in model container [2023-11-22 17:01:36,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:01:35" (2/3) ... [2023-11-22 17:01:36,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d994e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:01:36, skipping insertion in model container [2023-11-22 17:01:36,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:01:36" (3/3) ... [2023-11-22 17:01:36,388 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2023-11-22 17:01:36,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 17:01:36,404 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 162 error locations. [2023-11-22 17:01:36,461 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 17:01:36,470 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@10836cf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 17:01:36,470 INFO L358 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2023-11-22 17:01:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 161 states have (on average 2.186335403726708) internal successors, (352), 323 states have internal predecessors, (352), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-22 17:01:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 17:01:36,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:36,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 17:01:36,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:36,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash 619956658, now seen corresponding path program 1 times [2023-11-22 17:01:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:36,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620779856] [2023-11-22 17:01:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:36,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:36,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620779856] [2023-11-22 17:01:36,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620779856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:36,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:36,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:01:36,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233611227] [2023-11-22 17:01:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:36,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:01:36,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:36,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:01:36,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:01:36,847 INFO L87 Difference]: Start difference. First operand has 362 states, 161 states have (on average 2.186335403726708) internal successors, (352), 323 states have internal predecessors, (352), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:37,606 INFO L93 Difference]: Finished difference Result 417 states and 508 transitions. [2023-11-22 17:01:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:01:37,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5 [2023-11-22 17:01:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:37,629 INFO L225 Difference]: With dead ends: 417 [2023-11-22 17:01:37,630 INFO L226 Difference]: Without dead ends: 416 [2023-11-22 17:01:37,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:01:37,637 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 523 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:37,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 303 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 17:01:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2023-11-22 17:01:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 356. [2023-11-22 17:01:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 174 states have (on average 2.0) internal successors, (348), 312 states have internal predecessors, (348), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2023-11-22 17:01:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 417 transitions. [2023-11-22 17:01:37,733 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 417 transitions. Word has length 5 [2023-11-22 17:01:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:37,734 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 417 transitions. [2023-11-22 17:01:37,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 417 transitions. [2023-11-22 17:01:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 17:01:37,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:37,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 17:01:37,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 17:01:37,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:37,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:37,737 INFO L85 PathProgramCache]: Analyzing trace with hash 619956659, now seen corresponding path program 1 times [2023-11-22 17:01:37,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:37,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094362549] [2023-11-22 17:01:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:37,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:37,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:37,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094362549] [2023-11-22 17:01:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094362549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:37,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:37,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:01:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732472378] [2023-11-22 17:01:37,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:37,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:01:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:01:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:01:37,965 INFO L87 Difference]: Start difference. First operand 356 states and 417 transitions. Second operand has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:38,510 INFO L93 Difference]: Finished difference Result 498 states and 627 transitions. [2023-11-22 17:01:38,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:01:38,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5 [2023-11-22 17:01:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:38,514 INFO L225 Difference]: With dead ends: 498 [2023-11-22 17:01:38,514 INFO L226 Difference]: Without dead ends: 498 [2023-11-22 17:01:38,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:01:38,516 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 361 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:38,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 684 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 17:01:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-11-22 17:01:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 445. [2023-11-22 17:01:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 244 states have (on average 1.819672131147541) internal successors, (444), 378 states have internal predecessors, (444), 44 states have call successors, (44), 18 states have call predecessors, (44), 24 states have return successors, (80), 48 states have call predecessors, (80), 44 states have call successors, (80) [2023-11-22 17:01:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 568 transitions. [2023-11-22 17:01:38,539 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 568 transitions. Word has length 5 [2023-11-22 17:01:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:38,540 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 568 transitions. [2023-11-22 17:01:38,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 568 transitions. [2023-11-22 17:01:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-22 17:01:38,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:38,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:38,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 17:01:38,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:38,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash 769886529, now seen corresponding path program 1 times [2023-11-22 17:01:38,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:38,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855696547] [2023-11-22 17:01:38,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:38,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:38,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:38,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855696547] [2023-11-22 17:01:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855696547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:38,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 17:01:38,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774085079] [2023-11-22 17:01:38,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:38,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:01:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:01:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:01:38,676 INFO L87 Difference]: Start difference. First operand 445 states and 568 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:39,231 INFO L93 Difference]: Finished difference Result 472 states and 609 transitions. [2023-11-22 17:01:39,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:01:39,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-11-22 17:01:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:39,237 INFO L225 Difference]: With dead ends: 472 [2023-11-22 17:01:39,238 INFO L226 Difference]: Without dead ends: 472 [2023-11-22 17:01:39,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:01:39,240 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 147 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:39,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1037 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 17:01:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2023-11-22 17:01:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 444. [2023-11-22 17:01:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 244 states have (on average 1.8155737704918034) internal successors, (443), 377 states have internal predecessors, (443), 44 states have call successors, (44), 18 states have call predecessors, (44), 24 states have return successors, (80), 48 states have call predecessors, (80), 44 states have call successors, (80) [2023-11-22 17:01:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 567 transitions. [2023-11-22 17:01:39,270 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 567 transitions. Word has length 8 [2023-11-22 17:01:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:39,270 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 567 transitions. [2023-11-22 17:01:39,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 567 transitions. [2023-11-22 17:01:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-22 17:01:39,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:39,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:39,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 17:01:39,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:39,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash 769886530, now seen corresponding path program 1 times [2023-11-22 17:01:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:39,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760338229] [2023-11-22 17:01:39,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:39,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760338229] [2023-11-22 17:01:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760338229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:39,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:39,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 17:01:39,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861924410] [2023-11-22 17:01:39,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:39,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:01:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:39,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:01:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:01:39,425 INFO L87 Difference]: Start difference. First operand 444 states and 567 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:39,989 INFO L93 Difference]: Finished difference Result 471 states and 608 transitions. [2023-11-22 17:01:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:01:39,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-11-22 17:01:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:39,992 INFO L225 Difference]: With dead ends: 471 [2023-11-22 17:01:39,992 INFO L226 Difference]: Without dead ends: 471 [2023-11-22 17:01:39,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:01:39,994 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 144 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:39,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1015 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 17:01:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2023-11-22 17:01:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 443. [2023-11-22 17:01:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 244 states have (on average 1.8114754098360655) internal successors, (442), 376 states have internal predecessors, (442), 44 states have call successors, (44), 18 states have call predecessors, (44), 24 states have return successors, (80), 48 states have call predecessors, (80), 44 states have call successors, (80) [2023-11-22 17:01:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 566 transitions. [2023-11-22 17:01:40,009 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 566 transitions. Word has length 8 [2023-11-22 17:01:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:40,009 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 566 transitions. [2023-11-22 17:01:40,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 566 transitions. [2023-11-22 17:01:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 17:01:40,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:40,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:40,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 17:01:40,011 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:40,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:40,011 INFO L85 PathProgramCache]: Analyzing trace with hash 439290774, now seen corresponding path program 1 times [2023-11-22 17:01:40,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:40,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681750029] [2023-11-22 17:01:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:40,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:40,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:40,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:40,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681750029] [2023-11-22 17:01:40,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681750029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:40,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:40,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:01:40,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920486605] [2023-11-22 17:01:40,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:40,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:01:40,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:40,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:01:40,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:01:40,096 INFO L87 Difference]: Start difference. First operand 443 states and 566 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:40,426 INFO L93 Difference]: Finished difference Result 470 states and 607 transitions. [2023-11-22 17:01:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:01:40,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-22 17:01:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:40,429 INFO L225 Difference]: With dead ends: 470 [2023-11-22 17:01:40,429 INFO L226 Difference]: Without dead ends: 470 [2023-11-22 17:01:40,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:01:40,430 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 139 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:40,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 652 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 17:01:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-11-22 17:01:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 442. [2023-11-22 17:01:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 244 states have (on average 1.8073770491803278) internal successors, (441), 375 states have internal predecessors, (441), 44 states have call successors, (44), 18 states have call predecessors, (44), 24 states have return successors, (80), 48 states have call predecessors, (80), 44 states have call successors, (80) [2023-11-22 17:01:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 565 transitions. [2023-11-22 17:01:40,445 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 565 transitions. Word has length 12 [2023-11-22 17:01:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:40,445 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 565 transitions. [2023-11-22 17:01:40,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 565 transitions. [2023-11-22 17:01:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 17:01:40,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:40,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:40,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 17:01:40,447 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:40,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:40,447 INFO L85 PathProgramCache]: Analyzing trace with hash 439290775, now seen corresponding path program 1 times [2023-11-22 17:01:40,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028464459] [2023-11-22 17:01:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:40,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:40,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028464459] [2023-11-22 17:01:40,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028464459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:40,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:40,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:01:40,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151328164] [2023-11-22 17:01:40,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:40,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:01:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:40,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:01:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:01:40,537 INFO L87 Difference]: Start difference. First operand 442 states and 565 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:40,887 INFO L93 Difference]: Finished difference Result 469 states and 606 transitions. [2023-11-22 17:01:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:01:40,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-22 17:01:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:40,890 INFO L225 Difference]: With dead ends: 469 [2023-11-22 17:01:40,890 INFO L226 Difference]: Without dead ends: 469 [2023-11-22 17:01:40,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:01:40,891 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 138 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:40,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 638 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 17:01:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2023-11-22 17:01:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 441. [2023-11-22 17:01:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 244 states have (on average 1.8032786885245902) internal successors, (440), 374 states have internal predecessors, (440), 44 states have call successors, (44), 18 states have call predecessors, (44), 24 states have return successors, (80), 48 states have call predecessors, (80), 44 states have call successors, (80) [2023-11-22 17:01:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 564 transitions. [2023-11-22 17:01:40,905 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 564 transitions. Word has length 12 [2023-11-22 17:01:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:40,905 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 564 transitions. [2023-11-22 17:01:40,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 564 transitions. [2023-11-22 17:01:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 17:01:40,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:40,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:40,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 17:01:40,906 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:40,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash 960117984, now seen corresponding path program 1 times [2023-11-22 17:01:40,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:40,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409198064] [2023-11-22 17:01:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:41,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:41,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:41,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409198064] [2023-11-22 17:01:41,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409198064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:41,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:41,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 17:01:41,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855640594] [2023-11-22 17:01:41,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:41,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:01:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:41,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:01:41,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:01:41,131 INFO L87 Difference]: Start difference. First operand 441 states and 564 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:41,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:41,862 INFO L93 Difference]: Finished difference Result 500 states and 657 transitions. [2023-11-22 17:01:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 17:01:41,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-22 17:01:41,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:41,865 INFO L225 Difference]: With dead ends: 500 [2023-11-22 17:01:41,865 INFO L226 Difference]: Without dead ends: 500 [2023-11-22 17:01:41,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-22 17:01:41,866 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 214 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:41,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1398 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 17:01:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2023-11-22 17:01:41,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 459. [2023-11-22 17:01:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 259 states have (on average 1.7876447876447876) internal successors, (463), 389 states have internal predecessors, (463), 45 states have call successors, (45), 20 states have call predecessors, (45), 26 states have return successors, (83), 49 states have call predecessors, (83), 45 states have call successors, (83) [2023-11-22 17:01:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 591 transitions. [2023-11-22 17:01:41,879 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 591 transitions. Word has length 20 [2023-11-22 17:01:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:41,880 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 591 transitions. [2023-11-22 17:01:41,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 591 transitions. [2023-11-22 17:01:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 17:01:41,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:41,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:41,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 17:01:41,881 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:41,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:41,881 INFO L85 PathProgramCache]: Analyzing trace with hash 960117985, now seen corresponding path program 1 times [2023-11-22 17:01:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:41,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897169777] [2023-11-22 17:01:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:41,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:42,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:42,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:42,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897169777] [2023-11-22 17:01:42,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897169777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:42,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:42,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 17:01:42,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58099412] [2023-11-22 17:01:42,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:42,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:01:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:01:42,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:01:42,153 INFO L87 Difference]: Start difference. First operand 459 states and 591 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:42,937 INFO L93 Difference]: Finished difference Result 499 states and 656 transitions. [2023-11-22 17:01:42,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 17:01:42,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-22 17:01:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:42,941 INFO L225 Difference]: With dead ends: 499 [2023-11-22 17:01:42,941 INFO L226 Difference]: Without dead ends: 499 [2023-11-22 17:01:42,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-22 17:01:42,942 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 206 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:42,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1335 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 17:01:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2023-11-22 17:01:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 459. [2023-11-22 17:01:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 259 states have (on average 1.7837837837837838) internal successors, (462), 389 states have internal predecessors, (462), 45 states have call successors, (45), 20 states have call predecessors, (45), 26 states have return successors, (83), 49 states have call predecessors, (83), 45 states have call successors, (83) [2023-11-22 17:01:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 590 transitions. [2023-11-22 17:01:42,955 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 590 transitions. Word has length 20 [2023-11-22 17:01:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:42,956 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 590 transitions. [2023-11-22 17:01:42,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 590 transitions. [2023-11-22 17:01:42,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-22 17:01:42,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:42,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:42,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 17:01:42,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:42,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash -303906232, now seen corresponding path program 1 times [2023-11-22 17:01:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:42,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155434895] [2023-11-22 17:01:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:43,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:43,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:43,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155434895] [2023-11-22 17:01:43,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155434895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:43,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:43,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 17:01:43,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969637177] [2023-11-22 17:01:43,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:43,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:01:43,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:43,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:01:43,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:01:43,127 INFO L87 Difference]: Start difference. First operand 459 states and 590 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:43,882 INFO L93 Difference]: Finished difference Result 586 states and 782 transitions. [2023-11-22 17:01:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 17:01:43,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-22 17:01:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:43,886 INFO L225 Difference]: With dead ends: 586 [2023-11-22 17:01:43,886 INFO L226 Difference]: Without dead ends: 586 [2023-11-22 17:01:43,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-22 17:01:43,888 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 335 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:43,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1320 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 17:01:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-11-22 17:01:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 494. [2023-11-22 17:01:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 285 states have (on average 1.7719298245614035) internal successors, (505), 418 states have internal predecessors, (505), 51 states have call successors, (51), 24 states have call predecessors, (51), 29 states have return successors, (99), 51 states have call predecessors, (99), 51 states have call successors, (99) [2023-11-22 17:01:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 655 transitions. [2023-11-22 17:01:43,905 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 655 transitions. Word has length 21 [2023-11-22 17:01:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:43,905 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 655 transitions. [2023-11-22 17:01:43,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 655 transitions. [2023-11-22 17:01:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-22 17:01:43,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:43,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:43,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 17:01:43,908 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:43,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash -303906231, now seen corresponding path program 1 times [2023-11-22 17:01:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:43,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362045505] [2023-11-22 17:01:43,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:43,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:44,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:44,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:44,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362045505] [2023-11-22 17:01:44,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362045505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:44,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:44,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 17:01:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661178099] [2023-11-22 17:01:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:44,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:01:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:44,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:01:44,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:01:44,152 INFO L87 Difference]: Start difference. First operand 494 states and 655 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:44,605 INFO L93 Difference]: Finished difference Result 491 states and 609 transitions. [2023-11-22 17:01:44,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:01:44,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-22 17:01:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:44,607 INFO L225 Difference]: With dead ends: 491 [2023-11-22 17:01:44,607 INFO L226 Difference]: Without dead ends: 491 [2023-11-22 17:01:44,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-11-22 17:01:44,608 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 242 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:44,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1258 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 17:01:44,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-11-22 17:01:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 447. [2023-11-22 17:01:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 247 states have (on average 1.7813765182186234) internal successors, (440), 384 states have internal predecessors, (440), 43 states have call successors, (43), 22 states have call predecessors, (43), 28 states have return successors, (74), 40 states have call predecessors, (74), 43 states have call successors, (74) [2023-11-22 17:01:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 557 transitions. [2023-11-22 17:01:44,619 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 557 transitions. Word has length 21 [2023-11-22 17:01:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:44,619 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 557 transitions. [2023-11-22 17:01:44,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 557 transitions. [2023-11-22 17:01:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 17:01:44,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:44,620 INFO L195 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] [2023-11-22 17:01:44,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 17:01:44,621 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:44,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:44,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1556632198, now seen corresponding path program 1 times [2023-11-22 17:01:44,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:44,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31072879] [2023-11-22 17:01:44,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:44,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:44,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:44,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31072879] [2023-11-22 17:01:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31072879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:44,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:44,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 17:01:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145971210] [2023-11-22 17:01:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:44,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:01:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:44,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:01:44,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:01:44,744 INFO L87 Difference]: Start difference. First operand 447 states and 557 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:45,236 INFO L93 Difference]: Finished difference Result 490 states and 618 transitions. [2023-11-22 17:01:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 17:01:45,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-22 17:01:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:45,242 INFO L225 Difference]: With dead ends: 490 [2023-11-22 17:01:45,242 INFO L226 Difference]: Without dead ends: 486 [2023-11-22 17:01:45,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:01:45,243 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 158 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:45,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1172 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 17:01:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-11-22 17:01:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 454. [2023-11-22 17:01:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 253 states have (on average 1.7707509881422925) internal successors, (448), 390 states have internal predecessors, (448), 43 states have call successors, (43), 23 states have call predecessors, (43), 29 states have return successors, (69), 40 states have call predecessors, (69), 43 states have call successors, (69) [2023-11-22 17:01:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 560 transitions. [2023-11-22 17:01:45,254 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 560 transitions. Word has length 30 [2023-11-22 17:01:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:45,254 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 560 transitions. [2023-11-22 17:01:45,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 560 transitions. [2023-11-22 17:01:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 17:01:45,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:45,258 INFO L195 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] [2023-11-22 17:01:45,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 17:01:45,259 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:45,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:45,259 INFO L85 PathProgramCache]: Analyzing trace with hash -488368781, now seen corresponding path program 1 times [2023-11-22 17:01:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:45,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802067456] [2023-11-22 17:01:45,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:45,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:45,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:45,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 17:01:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:45,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 17:01:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:45,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:45,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802067456] [2023-11-22 17:01:45,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802067456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:45,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:45,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 17:01:45,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981185494] [2023-11-22 17:01:45,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:45,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 17:01:45,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:45,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 17:01:45,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:01:45,590 INFO L87 Difference]: Start difference. First operand 454 states and 560 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:01:46,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:46,432 INFO L93 Difference]: Finished difference Result 487 states and 631 transitions. [2023-11-22 17:01:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 17:01:46,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2023-11-22 17:01:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:46,439 INFO L225 Difference]: With dead ends: 487 [2023-11-22 17:01:46,439 INFO L226 Difference]: Without dead ends: 481 [2023-11-22 17:01:46,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-11-22 17:01:46,440 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 294 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:46,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1720 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 17:01:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2023-11-22 17:01:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 448. [2023-11-22 17:01:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 249 states have (on average 1.7791164658634537) internal successors, (443), 385 states have internal predecessors, (443), 43 states have call successors, (43), 23 states have call predecessors, (43), 27 states have return successors, (67), 39 states have call predecessors, (67), 43 states have call successors, (67) [2023-11-22 17:01:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 553 transitions. [2023-11-22 17:01:46,452 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 553 transitions. Word has length 29 [2023-11-22 17:01:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:46,453 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 553 transitions. [2023-11-22 17:01:46,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:01:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 553 transitions. [2023-11-22 17:01:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 17:01:46,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:46,455 INFO L195 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] [2023-11-22 17:01:46,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 17:01:46,456 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:46,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:46,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1996527512, now seen corresponding path program 1 times [2023-11-22 17:01:46,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:46,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142088713] [2023-11-22 17:01:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:46,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142088713] [2023-11-22 17:01:46,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142088713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:46,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:46,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 17:01:46,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491863929] [2023-11-22 17:01:46,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:46,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 17:01:46,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:46,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 17:01:46,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:01:46,737 INFO L87 Difference]: Start difference. First operand 448 states and 553 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:01:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:48,222 INFO L93 Difference]: Finished difference Result 639 states and 894 transitions. [2023-11-22 17:01:48,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-22 17:01:48,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2023-11-22 17:01:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:48,226 INFO L225 Difference]: With dead ends: 639 [2023-11-22 17:01:48,226 INFO L226 Difference]: Without dead ends: 635 [2023-11-22 17:01:48,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-11-22 17:01:48,228 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 628 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:48,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1947 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-22 17:01:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-11-22 17:01:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 589. [2023-11-22 17:01:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 356 states have (on average 1.6629213483146068) internal successors, (592), 481 states have internal predecessors, (592), 59 states have call successors, (59), 30 states have call predecessors, (59), 45 states have return successors, (208), 77 states have call predecessors, (208), 59 states have call successors, (208) [2023-11-22 17:01:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 859 transitions. [2023-11-22 17:01:48,249 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 859 transitions. Word has length 32 [2023-11-22 17:01:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:48,249 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 859 transitions. [2023-11-22 17:01:48,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:01:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 859 transitions. [2023-11-22 17:01:48,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 17:01:48,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:48,251 INFO L195 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] [2023-11-22 17:01:48,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 17:01:48,252 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:48,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:48,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2198270, now seen corresponding path program 1 times [2023-11-22 17:01:48,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:48,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470639865] [2023-11-22 17:01:48,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:48,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:48,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:48,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:48,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470639865] [2023-11-22 17:01:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470639865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:48,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:48,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 17:01:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467823659] [2023-11-22 17:01:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:48,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 17:01:48,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 17:01:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:01:48,682 INFO L87 Difference]: Start difference. First operand 589 states and 859 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:01:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:49,456 INFO L93 Difference]: Finished difference Result 627 states and 935 transitions. [2023-11-22 17:01:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 17:01:49,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-11-22 17:01:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:49,462 INFO L225 Difference]: With dead ends: 627 [2023-11-22 17:01:49,462 INFO L226 Difference]: Without dead ends: 627 [2023-11-22 17:01:49,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-11-22 17:01:49,463 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 669 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:49,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 350 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 17:01:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2023-11-22 17:01:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 596. [2023-11-22 17:01:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 376 states have (on average 1.5425531914893618) internal successors, (580), 476 states have internal predecessors, (580), 59 states have call successors, (59), 30 states have call predecessors, (59), 51 states have return successors, (241), 89 states have call predecessors, (241), 59 states have call successors, (241) [2023-11-22 17:01:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 880 transitions. [2023-11-22 17:01:49,485 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 880 transitions. Word has length 33 [2023-11-22 17:01:49,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:49,486 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 880 transitions. [2023-11-22 17:01:49,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:01:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 880 transitions. [2023-11-22 17:01:49,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 17:01:49,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:49,488 INFO L195 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] [2023-11-22 17:01:49,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 17:01:49,489 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:49,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:49,489 INFO L85 PathProgramCache]: Analyzing trace with hash 68146414, now seen corresponding path program 1 times [2023-11-22 17:01:49,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:49,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456194612] [2023-11-22 17:01:49,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:50,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:50,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:50,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:50,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456194612] [2023-11-22 17:01:50,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456194612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:50,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:50,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 17:01:50,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912187440] [2023-11-22 17:01:50,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:50,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 17:01:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:50,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 17:01:50,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-22 17:01:50,113 INFO L87 Difference]: Start difference. First operand 596 states and 880 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:01:51,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:51,453 INFO L93 Difference]: Finished difference Result 897 states and 1466 transitions. [2023-11-22 17:01:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 17:01:51,454 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2023-11-22 17:01:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:51,460 INFO L225 Difference]: With dead ends: 897 [2023-11-22 17:01:51,460 INFO L226 Difference]: Without dead ends: 895 [2023-11-22 17:01:51,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-11-22 17:01:51,463 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 432 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:51,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1422 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 17:01:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2023-11-22 17:01:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 776. [2023-11-22 17:01:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 509 states have (on average 1.475442043222004) internal successors, (751), 603 states have internal predecessors, (751), 75 states have call successors, (75), 39 states have call predecessors, (75), 82 states have return successors, (409), 133 states have call predecessors, (409), 75 states have call successors, (409) [2023-11-22 17:01:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1235 transitions. [2023-11-22 17:01:51,505 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1235 transitions. Word has length 34 [2023-11-22 17:01:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:51,505 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1235 transitions. [2023-11-22 17:01:51,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:01:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1235 transitions. [2023-11-22 17:01:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 17:01:51,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:51,506 INFO L195 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] [2023-11-22 17:01:51,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 17:01:51,507 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:51,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:51,507 INFO L85 PathProgramCache]: Analyzing trace with hash 68146415, now seen corresponding path program 1 times [2023-11-22 17:01:51,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100838377] [2023-11-22 17:01:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:52,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:52,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:52,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:52,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100838377] [2023-11-22 17:01:52,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100838377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:52,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:52,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-22 17:01:52,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027259131] [2023-11-22 17:01:52,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:52,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 17:01:52,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:52,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 17:01:52,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-22 17:01:52,490 INFO L87 Difference]: Start difference. First operand 776 states and 1235 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:01:53,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:53,935 INFO L93 Difference]: Finished difference Result 941 states and 1482 transitions. [2023-11-22 17:01:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:01:53,936 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2023-11-22 17:01:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:53,942 INFO L225 Difference]: With dead ends: 941 [2023-11-22 17:01:53,943 INFO L226 Difference]: Without dead ends: 941 [2023-11-22 17:01:53,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-11-22 17:01:53,943 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 633 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:53,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1592 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-22 17:01:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2023-11-22 17:01:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 783. [2023-11-22 17:01:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 515 states have (on average 1.4679611650485438) internal successors, (756), 602 states have internal predecessors, (756), 74 states have call successors, (74), 39 states have call predecessors, (74), 84 states have return successors, (431), 141 states have call predecessors, (431), 74 states have call successors, (431) [2023-11-22 17:01:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1261 transitions. [2023-11-22 17:01:53,983 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1261 transitions. Word has length 34 [2023-11-22 17:01:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:53,983 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1261 transitions. [2023-11-22 17:01:53,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:01:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1261 transitions. [2023-11-22 17:01:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 17:01:53,985 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:53,986 INFO L195 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] [2023-11-22 17:01:53,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-22 17:01:53,986 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:53,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:53,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1064197135, now seen corresponding path program 1 times [2023-11-22 17:01:53,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:53,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233847986] [2023-11-22 17:01:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:53,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:54,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:54,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233847986] [2023-11-22 17:01:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233847986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:54,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:54,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:01:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218285586] [2023-11-22 17:01:54,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:54,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:01:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:54,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:01:54,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:01:54,091 INFO L87 Difference]: Start difference. First operand 783 states and 1261 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:54,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:54,517 INFO L93 Difference]: Finished difference Result 811 states and 1311 transitions. [2023-11-22 17:01:54,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:01:54,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-22 17:01:54,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:54,522 INFO L225 Difference]: With dead ends: 811 [2023-11-22 17:01:54,522 INFO L226 Difference]: Without dead ends: 811 [2023-11-22 17:01:54,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:01:54,522 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 131 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:54,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 717 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 17:01:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-11-22 17:01:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 781. [2023-11-22 17:01:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 515 states have (on average 1.4601941747572815) internal successors, (752), 600 states have internal predecessors, (752), 74 states have call successors, (74), 39 states have call predecessors, (74), 84 states have return successors, (431), 141 states have call predecessors, (431), 74 states have call successors, (431) [2023-11-22 17:01:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1257 transitions. [2023-11-22 17:01:54,551 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1257 transitions. Word has length 36 [2023-11-22 17:01:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:54,551 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1257 transitions. [2023-11-22 17:01:54,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1257 transitions. [2023-11-22 17:01:54,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 17:01:54,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:54,552 INFO L195 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] [2023-11-22 17:01:54,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-22 17:01:54,553 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:54,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:54,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1064197136, now seen corresponding path program 1 times [2023-11-22 17:01:54,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:54,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804047445] [2023-11-22 17:01:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:54,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:54,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:54,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:54,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:54,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804047445] [2023-11-22 17:01:54,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804047445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:54,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:54,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:01:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770103808] [2023-11-22 17:01:54,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:54,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:01:54,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:54,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:01:54,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:01:54,684 INFO L87 Difference]: Start difference. First operand 781 states and 1257 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:55,092 INFO L93 Difference]: Finished difference Result 809 states and 1307 transitions. [2023-11-22 17:01:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:01:55,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-22 17:01:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:55,097 INFO L225 Difference]: With dead ends: 809 [2023-11-22 17:01:55,097 INFO L226 Difference]: Without dead ends: 809 [2023-11-22 17:01:55,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:01:55,097 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 127 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:55,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 729 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 17:01:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2023-11-22 17:01:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 779. [2023-11-22 17:01:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 515 states have (on average 1.4524271844660195) internal successors, (748), 598 states have internal predecessors, (748), 74 states have call successors, (74), 39 states have call predecessors, (74), 84 states have return successors, (431), 141 states have call predecessors, (431), 74 states have call successors, (431) [2023-11-22 17:01:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1253 transitions. [2023-11-22 17:01:55,133 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1253 transitions. Word has length 36 [2023-11-22 17:01:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:55,134 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1253 transitions. [2023-11-22 17:01:55,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1253 transitions. [2023-11-22 17:01:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-22 17:01:55,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:55,135 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:55,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-22 17:01:55,135 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:55,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash -346881663, now seen corresponding path program 1 times [2023-11-22 17:01:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041630540] [2023-11-22 17:01:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:55,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:55,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041630540] [2023-11-22 17:01:55,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041630540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:55,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 17:01:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462308742] [2023-11-22 17:01:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:55,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 17:01:55,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:55,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 17:01:55,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-22 17:01:55,332 INFO L87 Difference]: Start difference. First operand 779 states and 1253 transitions. Second operand has 9 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:56,177 INFO L93 Difference]: Finished difference Result 868 states and 1443 transitions. [2023-11-22 17:01:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:01:56,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-11-22 17:01:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:56,184 INFO L225 Difference]: With dead ends: 868 [2023-11-22 17:01:56,185 INFO L226 Difference]: Without dead ends: 868 [2023-11-22 17:01:56,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-11-22 17:01:56,186 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 328 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:56,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1311 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 17:01:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2023-11-22 17:01:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 818. [2023-11-22 17:01:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 547 states have (on average 1.4515539305301646) internal successors, (794), 631 states have internal predecessors, (794), 76 states have call successors, (76), 43 states have call predecessors, (76), 89 states have return successors, (442), 143 states have call predecessors, (442), 76 states have call successors, (442) [2023-11-22 17:01:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1312 transitions. [2023-11-22 17:01:56,222 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1312 transitions. Word has length 44 [2023-11-22 17:01:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:56,223 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1312 transitions. [2023-11-22 17:01:56,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1312 transitions. [2023-11-22 17:01:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-22 17:01:56,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:56,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:56,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-22 17:01:56,224 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:56,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash -346881662, now seen corresponding path program 1 times [2023-11-22 17:01:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:56,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781627091] [2023-11-22 17:01:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:56,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:56,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:56,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:56,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781627091] [2023-11-22 17:01:56,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781627091] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 17:01:56,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732151276] [2023-11-22 17:01:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:56,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 17:01:56,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 17:01:56,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 17:01:56,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 17:01:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:56,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 17:01:56,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:01:56,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 17:01:56,979 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 15 treesize of output 7 [2023-11-22 17:01:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:56,995 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:01:56,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732151276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:56,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 17:01:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2023-11-22 17:01:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543620066] [2023-11-22 17:01:56,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:56,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 17:01:56,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:56,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 17:01:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-11-22 17:01:56,997 INFO L87 Difference]: Start difference. First operand 818 states and 1312 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:57,513 INFO L93 Difference]: Finished difference Result 998 states and 1584 transitions. [2023-11-22 17:01:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 17:01:57,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-11-22 17:01:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:57,519 INFO L225 Difference]: With dead ends: 998 [2023-11-22 17:01:57,519 INFO L226 Difference]: Without dead ends: 994 [2023-11-22 17:01:57,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2023-11-22 17:01:57,520 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 190 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:57,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1728 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 17:01:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2023-11-22 17:01:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 956. [2023-11-22 17:01:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 656 states have (on average 1.4496951219512195) internal successors, (951), 733 states have internal predecessors, (951), 93 states have call successors, (93), 53 states have call predecessors, (93), 101 states have return successors, (510), 169 states have call predecessors, (510), 93 states have call successors, (510) [2023-11-22 17:01:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1554 transitions. [2023-11-22 17:01:57,556 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1554 transitions. Word has length 44 [2023-11-22 17:01:57,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:57,556 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 1554 transitions. [2023-11-22 17:01:57,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1554 transitions. [2023-11-22 17:01:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 17:01:57,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:57,557 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:57,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 17:01:57,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 17:01:57,774 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:57,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:57,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2128777671, now seen corresponding path program 1 times [2023-11-22 17:01:57,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:57,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719474879] [2023-11-22 17:01:57,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:57,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:57,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:57,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719474879] [2023-11-22 17:01:57,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719474879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:57,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:57,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 17:01:57,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513662929] [2023-11-22 17:01:57,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:57,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 17:01:57,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:57,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 17:01:57,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-22 17:01:57,966 INFO L87 Difference]: Start difference. First operand 956 states and 1554 transitions. Second operand has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:58,799 INFO L93 Difference]: Finished difference Result 1109 states and 1883 transitions. [2023-11-22 17:01:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:01:58,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-11-22 17:01:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:58,808 INFO L225 Difference]: With dead ends: 1109 [2023-11-22 17:01:58,808 INFO L226 Difference]: Without dead ends: 1109 [2023-11-22 17:01:58,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-11-22 17:01:58,809 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 320 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:58,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1336 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 17:01:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2023-11-22 17:01:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 983. [2023-11-22 17:01:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 677 states have (on average 1.4534711964549483) internal successors, (984), 754 states have internal predecessors, (984), 96 states have call successors, (96), 56 states have call predecessors, (96), 104 states have return successors, (525), 172 states have call predecessors, (525), 96 states have call successors, (525) [2023-11-22 17:01:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1605 transitions. [2023-11-22 17:01:58,851 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1605 transitions. Word has length 45 [2023-11-22 17:01:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:58,852 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1605 transitions. [2023-11-22 17:01:58,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1605 transitions. [2023-11-22 17:01:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 17:01:58,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:58,853 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:58,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-22 17:01:58,853 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:58,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2128777672, now seen corresponding path program 1 times [2023-11-22 17:01:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305901807] [2023-11-22 17:01:58,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:58,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:01:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:01:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:01:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305901807] [2023-11-22 17:01:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305901807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:59,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 17:01:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195254043] [2023-11-22 17:01:59,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:59,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 17:01:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:01:59,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 17:01:59,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-22 17:01:59,132 INFO L87 Difference]: Start difference. First operand 983 states and 1605 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:59,884 INFO L93 Difference]: Finished difference Result 1041 states and 1751 transitions. [2023-11-22 17:01:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 17:01:59,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-11-22 17:01:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:59,895 INFO L225 Difference]: With dead ends: 1041 [2023-11-22 17:01:59,895 INFO L226 Difference]: Without dead ends: 1041 [2023-11-22 17:01:59,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-11-22 17:01:59,896 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 335 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:59,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1356 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 17:01:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2023-11-22 17:01:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 983. [2023-11-22 17:01:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 677 states have (on average 1.4490398818316101) internal successors, (981), 754 states have internal predecessors, (981), 96 states have call successors, (96), 56 states have call predecessors, (96), 104 states have return successors, (525), 172 states have call predecessors, (525), 96 states have call successors, (525) [2023-11-22 17:01:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1602 transitions. [2023-11-22 17:01:59,930 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1602 transitions. Word has length 45 [2023-11-22 17:01:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:59,931 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1602 transitions. [2023-11-22 17:01:59,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:01:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1602 transitions. [2023-11-22 17:01:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-22 17:01:59,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:59,933 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:59,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-22 17:01:59,933 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:01:59,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:59,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1565367646, now seen corresponding path program 1 times [2023-11-22 17:01:59,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:01:59,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894389652] [2023-11-22 17:01:59,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:59,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:01:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:00,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:02:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:02:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:02:00,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:02:00,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894389652] [2023-11-22 17:02:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894389652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:02:00,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:02:00,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 17:02:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236058807] [2023-11-22 17:02:00,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:02:00,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 17:02:00,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:02:00,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 17:02:00,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-22 17:02:00,191 INFO L87 Difference]: Start difference. First operand 983 states and 1602 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:02:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:02:01,174 INFO L93 Difference]: Finished difference Result 1198 states and 2067 transitions. [2023-11-22 17:02:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:02:01,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2023-11-22 17:02:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:02:01,184 INFO L225 Difference]: With dead ends: 1198 [2023-11-22 17:02:01,184 INFO L226 Difference]: Without dead ends: 1198 [2023-11-22 17:02:01,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-11-22 17:02:01,186 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 274 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 17:02:01,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1375 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 17:02:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2023-11-22 17:02:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1080. [2023-11-22 17:02:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 757 states have (on average 1.4504623513870543) internal successors, (1098), 839 states have internal predecessors, (1098), 100 states have call successors, (100), 63 states have call predecessors, (100), 117 states have return successors, (566), 177 states have call predecessors, (566), 100 states have call successors, (566) [2023-11-22 17:02:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1764 transitions. [2023-11-22 17:02:01,275 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1764 transitions. Word has length 46 [2023-11-22 17:02:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:02:01,276 INFO L495 AbstractCegarLoop]: Abstraction has 1080 states and 1764 transitions. [2023-11-22 17:02:01,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:02:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1764 transitions. [2023-11-22 17:02:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-22 17:02:01,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:02:01,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:02:01,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-22 17:02:01,277 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:02:01,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:02:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1565367647, now seen corresponding path program 1 times [2023-11-22 17:02:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:02:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118106472] [2023-11-22 17:02:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:02:01,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:02:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:02:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:02:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:02:01,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:02:01,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118106472] [2023-11-22 17:02:01,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118106472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:02:01,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:02:01,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 17:02:01,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592494127] [2023-11-22 17:02:01,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:02:01,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 17:02:01,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:02:01,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 17:02:01,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-22 17:02:01,556 INFO L87 Difference]: Start difference. First operand 1080 states and 1764 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:02:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:02:02,445 INFO L93 Difference]: Finished difference Result 1193 states and 1985 transitions. [2023-11-22 17:02:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-22 17:02:02,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2023-11-22 17:02:02,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:02:02,454 INFO L225 Difference]: With dead ends: 1193 [2023-11-22 17:02:02,454 INFO L226 Difference]: Without dead ends: 1193 [2023-11-22 17:02:02,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:02:02,455 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 411 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:02:02,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1890 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 17:02:02,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2023-11-22 17:02:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1147. [2023-11-22 17:02:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 805 states have (on average 1.4111801242236024) internal successors, (1136), 874 states have internal predecessors, (1136), 101 states have call successors, (101), 65 states have call predecessors, (101), 135 states have return successors, (686), 207 states have call predecessors, (686), 101 states have call successors, (686) [2023-11-22 17:02:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1923 transitions. [2023-11-22 17:02:02,502 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1923 transitions. Word has length 46 [2023-11-22 17:02:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:02:02,503 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1923 transitions. [2023-11-22 17:02:02,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:02:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1923 transitions. [2023-11-22 17:02:02,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-22 17:02:02,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:02:02,504 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:02:02,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-22 17:02:02,504 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:02:02,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:02:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1981840163, now seen corresponding path program 1 times [2023-11-22 17:02:02,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:02:02,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613864172] [2023-11-22 17:02:02,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:02:02,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:02:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:02:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:02,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:02:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 17:02:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-22 17:02:02,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:02:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613864172] [2023-11-22 17:02:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613864172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:02:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:02:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 17:02:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946590911] [2023-11-22 17:02:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:02:02,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:02:02,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:02:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:02:02,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:02:02,643 INFO L87 Difference]: Start difference. First operand 1147 states and 1923 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 17:02:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:02:03,028 INFO L93 Difference]: Finished difference Result 1170 states and 1971 transitions. [2023-11-22 17:02:03,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:02:03,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-11-22 17:02:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:02:03,037 INFO L225 Difference]: With dead ends: 1170 [2023-11-22 17:02:03,037 INFO L226 Difference]: Without dead ends: 1170 [2023-11-22 17:02:03,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:02:03,038 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 277 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 17:02:03,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 747 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 17:02:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2023-11-22 17:02:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1145. [2023-11-22 17:02:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 805 states have (on average 1.4086956521739131) internal successors, (1134), 872 states have internal predecessors, (1134), 101 states have call successors, (101), 65 states have call predecessors, (101), 135 states have return successors, (686), 207 states have call predecessors, (686), 101 states have call successors, (686) [2023-11-22 17:02:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1921 transitions. [2023-11-22 17:02:03,090 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1921 transitions. Word has length 51 [2023-11-22 17:02:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:02:03,090 INFO L495 AbstractCegarLoop]: Abstraction has 1145 states and 1921 transitions. [2023-11-22 17:02:03,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 17:02:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1921 transitions. [2023-11-22 17:02:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-22 17:02:03,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:02:03,092 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:02:03,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-22 17:02:03,092 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:02:03,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:02:03,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1981840164, now seen corresponding path program 1 times [2023-11-22 17:02:03,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:02:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684367915] [2023-11-22 17:02:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:02:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:02:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:02:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:03,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:02:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:04,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 17:02:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 17:02:04,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:02:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684367915] [2023-11-22 17:02:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684367915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 17:02:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206094218] [2023-11-22 17:02:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:02:04,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 17:02:04,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 17:02:04,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 17:02:04,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 17:02:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:04,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-22 17:02:04,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:02:04,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-22 17:02:04,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-22 17:02:04,329 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 30 treesize of output 14 [2023-11-22 17:02:04,371 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-22 17:02:04,372 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 75 [2023-11-22 17:02:04,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2023-11-22 17:02:04,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2023-11-22 17:02:04,408 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 47 treesize of output 29 [2023-11-22 17:02:04,413 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 30 treesize of output 25 [2023-11-22 17:02:04,416 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 37 treesize of output 25 [2023-11-22 17:02:04,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2023-11-22 17:02:04,432 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 30 treesize of output 25 [2023-11-22 17:02:04,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-11-22 17:02:04,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2023-11-22 17:02:04,456 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 30 treesize of output 25 [2023-11-22 17:02:04,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-11-22 17:02:04,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-11-22 17:02:04,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-11-22 17:02:04,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-22 17:02:04,602 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 47 treesize of output 29 [2023-11-22 17:02:04,608 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 30 treesize of output 25 [2023-11-22 17:02:04,611 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 37 treesize of output 25 [2023-11-22 17:02:04,631 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 41 treesize of output 23 [2023-11-22 17:02:04,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-22 17:02:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:02:04,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:02:04,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206094218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:02:04,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 17:02:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 19 [2023-11-22 17:02:04,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043744071] [2023-11-22 17:02:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:02:04,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 17:02:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:02:04,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 17:02:04,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-22 17:02:04,642 INFO L87 Difference]: Start difference. First operand 1145 states and 1921 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:02:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:02:05,338 INFO L93 Difference]: Finished difference Result 1165 states and 1940 transitions. [2023-11-22 17:02:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:02:05,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2023-11-22 17:02:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:02:05,345 INFO L225 Difference]: With dead ends: 1165 [2023-11-22 17:02:05,346 INFO L226 Difference]: Without dead ends: 1165 [2023-11-22 17:02:05,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2023-11-22 17:02:05,347 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 402 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 17:02:05,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1394 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 17:02:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2023-11-22 17:02:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1148. [2023-11-22 17:02:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 805 states have (on average 1.4074534161490684) internal successors, (1133), 874 states have internal predecessors, (1133), 103 states have call successors, (103), 66 states have call predecessors, (103), 136 states have return successors, (688), 207 states have call predecessors, (688), 103 states have call successors, (688) [2023-11-22 17:02:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1924 transitions. [2023-11-22 17:02:05,393 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1924 transitions. Word has length 51 [2023-11-22 17:02:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:02:05,394 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1924 transitions. [2023-11-22 17:02:05,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:02:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1924 transitions. [2023-11-22 17:02:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-22 17:02:05,417 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:02:05,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:02:05,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 17:02:05,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-22 17:02:05,630 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:02:05,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:02:05,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2062929860, now seen corresponding path program 1 times [2023-11-22 17:02:05,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:02:05,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038960018] [2023-11-22 17:02:05,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:02:05,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:02:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:02:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:05,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:02:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 17:02:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 17:02:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:02:05,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038960018] [2023-11-22 17:02:05,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038960018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:02:05,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:02:05,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 17:02:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556168845] [2023-11-22 17:02:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:02:05,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 17:02:05,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:02:05,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 17:02:05,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:02:05,953 INFO L87 Difference]: Start difference. First operand 1148 states and 1924 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 17:02:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:02:06,645 INFO L93 Difference]: Finished difference Result 1393 states and 2463 transitions. [2023-11-22 17:02:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 17:02:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-11-22 17:02:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:02:06,655 INFO L225 Difference]: With dead ends: 1393 [2023-11-22 17:02:06,656 INFO L226 Difference]: Without dead ends: 1393 [2023-11-22 17:02:06,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-11-22 17:02:06,656 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 330 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 17:02:06,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 2035 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 17:02:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2023-11-22 17:02:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1346. [2023-11-22 17:02:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 960 states have (on average 1.3864583333333333) internal successors, (1331), 1029 states have internal predecessors, (1331), 122 states have call successors, (122), 84 states have call predecessors, (122), 160 states have return successors, (892), 232 states have call predecessors, (892), 122 states have call successors, (892) [2023-11-22 17:02:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2345 transitions. [2023-11-22 17:02:06,717 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 2345 transitions. Word has length 51 [2023-11-22 17:02:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:02:06,719 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 2345 transitions. [2023-11-22 17:02:06,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 17:02:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 2345 transitions. [2023-11-22 17:02:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 17:02:06,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:02:06,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:02:06,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-22 17:02:06,721 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:02:06,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:02:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash 831225915, now seen corresponding path program 1 times [2023-11-22 17:02:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:02:06,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35726562] [2023-11-22 17:02:06,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:02:06,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:02:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 17:02:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:06,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 17:02:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:06,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 17:02:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:02:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-22 17:02:06,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 17:02:06,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35726562] [2023-11-22 17:02:06,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35726562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:02:06,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:02:06,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 17:02:06,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340893065] [2023-11-22 17:02:06,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:02:06,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:02:06,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 17:02:06,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:02:06,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:02:06,883 INFO L87 Difference]: Start difference. First operand 1346 states and 2345 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 17:02:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:02:07,266 INFO L93 Difference]: Finished difference Result 1347 states and 2346 transitions. [2023-11-22 17:02:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:02:07,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2023-11-22 17:02:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:02:07,275 INFO L225 Difference]: With dead ends: 1347 [2023-11-22 17:02:07,275 INFO L226 Difference]: Without dead ends: 1347 [2023-11-22 17:02:07,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:02:07,275 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 277 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 17:02:07,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 743 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 17:02:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2023-11-22 17:02:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1344. [2023-11-22 17:02:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 960 states have (on average 1.384375) internal successors, (1329), 1027 states have internal predecessors, (1329), 122 states have call successors, (122), 84 states have call predecessors, (122), 160 states have return successors, (892), 232 states have call predecessors, (892), 122 states have call successors, (892) [2023-11-22 17:02:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2343 transitions. [2023-11-22 17:02:07,331 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2343 transitions. Word has length 52 [2023-11-22 17:02:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:02:07,331 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 2343 transitions. [2023-11-22 17:02:07,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 17:02:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2343 transitions. [2023-11-22 17:02:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 17:02:07,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:02:07,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:02:07,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-22 17:02:07,332 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2023-11-22 17:02:07,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:02:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash 831225916, now seen corresponding path program 1 times [2023-11-22 17:02:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 17:02:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411343591] [2023-11-22 17:02:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:02:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 17:02:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 17:02:07,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 17:02:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 17:02:07,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 17:02:07,431 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 17:02:07,432 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 162 remaining) [2023-11-22 17:02:07,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 162 remaining) [2023-11-22 17:02:07,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 162 remaining) [2023-11-22 17:02:07,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 162 remaining) [2023-11-22 17:02:07,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 162 remaining) [2023-11-22 17:02:07,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 162 remaining) [2023-11-22 17:02:07,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 162 remaining) [2023-11-22 17:02:07,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 162 remaining) [2023-11-22 17:02:07,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 162 remaining) [2023-11-22 17:02:07,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 162 remaining) [2023-11-22 17:02:07,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 162 remaining) [2023-11-22 17:02:07,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 162 remaining) [2023-11-22 17:02:07,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 162 remaining) [2023-11-22 17:02:07,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 162 remaining) [2023-11-22 17:02:07,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 162 remaining) [2023-11-22 17:02:07,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 162 remaining) [2023-11-22 17:02:07,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 162 remaining) [2023-11-22 17:02:07,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 162 remaining) [2023-11-22 17:02:07,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 162 remaining) [2023-11-22 17:02:07,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 162 remaining) [2023-11-22 17:02:07,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 162 remaining) [2023-11-22 17:02:07,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 162 remaining) [2023-11-22 17:02:07,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 162 remaining) [2023-11-22 17:02:07,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 162 remaining) [2023-11-22 17:02:07,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 162 remaining) [2023-11-22 17:02:07,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 162 remaining) [2023-11-22 17:02:07,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 162 remaining) [2023-11-22 17:02:07,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 162 remaining) [2023-11-22 17:02:07,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 162 remaining) [2023-11-22 17:02:07,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 162 remaining) [2023-11-22 17:02:07,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 162 remaining) [2023-11-22 17:02:07,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 162 remaining) [2023-11-22 17:02:07,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 162 remaining) [2023-11-22 17:02:07,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 162 remaining) [2023-11-22 17:02:07,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 162 remaining) [2023-11-22 17:02:07,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 162 remaining) [2023-11-22 17:02:07,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 162 remaining) [2023-11-22 17:02:07,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 162 remaining) [2023-11-22 17:02:07,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 162 remaining) [2023-11-22 17:02:07,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 162 remaining) [2023-11-22 17:02:07,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 162 remaining) [2023-11-22 17:02:07,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 162 remaining) [2023-11-22 17:02:07,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 162 remaining) [2023-11-22 17:02:07,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 162 remaining) [2023-11-22 17:02:07,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 162 remaining) [2023-11-22 17:02:07,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 162 remaining) [2023-11-22 17:02:07,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 162 remaining) [2023-11-22 17:02:07,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 162 remaining) [2023-11-22 17:02:07,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 162 remaining) [2023-11-22 17:02:07,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 162 remaining) [2023-11-22 17:02:07,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 162 remaining) [2023-11-22 17:02:07,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 162 remaining) [2023-11-22 17:02:07,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 162 remaining) [2023-11-22 17:02:07,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 162 remaining) [2023-11-22 17:02:07,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 162 remaining) [2023-11-22 17:02:07,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 162 remaining) [2023-11-22 17:02:07,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 162 remaining) [2023-11-22 17:02:07,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 162 remaining) [2023-11-22 17:02:07,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 162 remaining) [2023-11-22 17:02:07,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 162 remaining) [2023-11-22 17:02:07,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 162 remaining) [2023-11-22 17:02:07,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 162 remaining) [2023-11-22 17:02:07,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 162 remaining) [2023-11-22 17:02:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 162 remaining) [2023-11-22 17:02:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 162 remaining) [2023-11-22 17:02:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 162 remaining) [2023-11-22 17:02:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 162 remaining) [2023-11-22 17:02:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 162 remaining) [2023-11-22 17:02:07,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 162 remaining) [2023-11-22 17:02:07,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 162 remaining) [2023-11-22 17:02:07,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 162 remaining) [2023-11-22 17:02:07,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 162 remaining) [2023-11-22 17:02:07,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 162 remaining) [2023-11-22 17:02:07,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 162 remaining) [2023-11-22 17:02:07,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 162 remaining) [2023-11-22 17:02:07,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 162 remaining) [2023-11-22 17:02:07,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 162 remaining) [2023-11-22 17:02:07,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 162 remaining) [2023-11-22 17:02:07,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 162 remaining) [2023-11-22 17:02:07,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 162 remaining) [2023-11-22 17:02:07,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 162 remaining) [2023-11-22 17:02:07,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 162 remaining) [2023-11-22 17:02:07,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 162 remaining) [2023-11-22 17:02:07,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 162 remaining) [2023-11-22 17:02:07,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 162 remaining) [2023-11-22 17:02:07,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 162 remaining) [2023-11-22 17:02:07,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 162 remaining) [2023-11-22 17:02:07,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 162 remaining) [2023-11-22 17:02:07,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 162 remaining) [2023-11-22 17:02:07,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 162 remaining) [2023-11-22 17:02:07,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 162 remaining) [2023-11-22 17:02:07,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 162 remaining) [2023-11-22 17:02:07,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 162 remaining) [2023-11-22 17:02:07,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 162 remaining) [2023-11-22 17:02:07,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 162 remaining) [2023-11-22 17:02:07,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 162 remaining) [2023-11-22 17:02:07,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 162 remaining) [2023-11-22 17:02:07,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 162 remaining) [2023-11-22 17:02:07,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 162 remaining) [2023-11-22 17:02:07,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 162 remaining) [2023-11-22 17:02:07,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 162 remaining) [2023-11-22 17:02:07,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 162 remaining) [2023-11-22 17:02:07,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 162 remaining) [2023-11-22 17:02:07,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 162 remaining) [2023-11-22 17:02:07,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 162 remaining) [2023-11-22 17:02:07,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 162 remaining) [2023-11-22 17:02:07,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 162 remaining) [2023-11-22 17:02:07,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 162 remaining) [2023-11-22 17:02:07,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (33 of 162 remaining) [2023-11-22 17:02:07,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (32 of 162 remaining) [2023-11-22 17:02:07,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 162 remaining) [2023-11-22 17:02:07,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 162 remaining) [2023-11-22 17:02:07,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 162 remaining) [2023-11-22 17:02:07,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 162 remaining) [2023-11-22 17:02:07,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 162 remaining) [2023-11-22 17:02:07,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 162 remaining) [2023-11-22 17:02:07,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 162 remaining) [2023-11-22 17:02:07,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 162 remaining) [2023-11-22 17:02:07,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 162 remaining) [2023-11-22 17:02:07,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 162 remaining) [2023-11-22 17:02:07,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 162 remaining) [2023-11-22 17:02:07,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 162 remaining) [2023-11-22 17:02:07,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 162 remaining) [2023-11-22 17:02:07,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 162 remaining) [2023-11-22 17:02:07,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 162 remaining) [2023-11-22 17:02:07,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 162 remaining) [2023-11-22 17:02:07,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 162 remaining) [2023-11-22 17:02:07,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 162 remaining) [2023-11-22 17:02:07,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 162 remaining) [2023-11-22 17:02:07,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 162 remaining) [2023-11-22 17:02:07,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 162 remaining) [2023-11-22 17:02:07,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 162 remaining) [2023-11-22 17:02:07,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 162 remaining) [2023-11-22 17:02:07,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 162 remaining) [2023-11-22 17:02:07,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 162 remaining) [2023-11-22 17:02:07,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 162 remaining) [2023-11-22 17:02:07,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 162 remaining) [2023-11-22 17:02:07,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 162 remaining) [2023-11-22 17:02:07,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 162 remaining) [2023-11-22 17:02:07,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 162 remaining) [2023-11-22 17:02:07,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 162 remaining) [2023-11-22 17:02:07,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 162 remaining) [2023-11-22 17:02:07,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-22 17:02:07,467 INFO L445 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] [2023-11-22 17:02:07,472 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 17:02:07,490 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-22 17:02:07,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,500 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated [2023-11-22 17:02:07,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated [2023-11-22 17:02:07,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated [2023-11-22 17:02:07,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-22 17:02:07,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-22 17:02:07,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-22 17:02:07,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated [2023-11-22 17:02:07,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-22 17:02:07,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-22 17:02:07,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc59 [2023-11-22 17:02:07,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-22 17:02:07,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc59 [2023-11-22 17:02:07,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-22 17:02:07,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:02:07 BoogieIcfgContainer [2023-11-22 17:02:07,517 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 17:02:07,518 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 17:02:07,518 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 17:02:07,518 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 17:02:07,518 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:01:36" (3/4) ... [2023-11-22 17:02:07,519 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-22 17:02:07,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc78 [2023-11-22 17:02:07,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argv [2023-11-22 17:02:07,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #in~argc [2023-11-22 17:02:07,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-22 17:02:07,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated [2023-11-22 17:02:07,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated [2023-11-22 17:02:07,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated [2023-11-22 17:02:07,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-22 17:02:07,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem35 [2023-11-22 17:02:07,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-22 17:02:07,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated [2023-11-22 17:02:07,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-22 17:02:07,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-22 17:02:07,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-22 17:02:07,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc59 [2023-11-22 17:02:07,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc59 [2023-11-22 17:02:07,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated [2023-11-22 17:02:07,598 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 17:02:07,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 17:02:07,599 INFO L158 Benchmark]: Toolchain (without parser) took 33138.24ms. Allocated memory was 138.4MB in the beginning and 436.2MB in the end (delta: 297.8MB). Free memory was 102.7MB in the beginning and 264.4MB in the end (delta: -161.7MB). Peak memory consumption was 137.1MB. Max. memory is 16.1GB. [2023-11-22 17:02:07,599 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 82.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:02:07,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.01ms. Allocated memory is still 138.4MB. Free memory was 101.9MB in the beginning and 76.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-22 17:02:07,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.90ms. Allocated memory is still 138.4MB. Free memory was 76.7MB in the beginning and 73.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 17:02:07,600 INFO L158 Benchmark]: Boogie Preprocessor took 100.45ms. Allocated memory is still 138.4MB. Free memory was 73.3MB in the beginning and 68.4MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-22 17:02:07,600 INFO L158 Benchmark]: RCFGBuilder took 1106.14ms. Allocated memory is still 138.4MB. Free memory was 68.4MB in the beginning and 49.2MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-22 17:02:07,601 INFO L158 Benchmark]: TraceAbstraction took 31136.49ms. Allocated memory was 138.4MB in the beginning and 436.2MB in the end (delta: 297.8MB). Free memory was 48.3MB in the beginning and 269.6MB in the end (delta: -221.3MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2023-11-22 17:02:07,601 INFO L158 Benchmark]: Witness Printer took 81.20ms. Allocated memory is still 436.2MB. Free memory was 269.6MB in the beginning and 264.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-22 17:02:07,602 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 82.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.01ms. Allocated memory is still 138.4MB. Free memory was 101.9MB in the beginning and 76.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.90ms. Allocated memory is still 138.4MB. Free memory was 76.7MB in the beginning and 73.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.45ms. Allocated memory is still 138.4MB. Free memory was 73.3MB in the beginning and 68.4MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1106.14ms. Allocated memory is still 138.4MB. Free memory was 68.4MB in the beginning and 49.2MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31136.49ms. Allocated memory was 138.4MB in the beginning and 436.2MB in the end (delta: 297.8MB). Free memory was 48.3MB in the beginning and 269.6MB in the end (delta: -221.3MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. * Witness Printer took 81.20ms. Allocated memory is still 436.2MB. Free memory was 269.6MB in the beginning and 264.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc59 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc59 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc78 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argv - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #in~argc - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~argc has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem35 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc59 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc59 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~switch54 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: [L779] user_t *user; [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L967] user->message.id = 11 VAL [user={-1:0}] [L968] EXPR user->info VAL [user={-1:0}] [L968] user->info->is_valid = 0 [L969] user->status = AS_NULL VAL [user={-1:0}] [L970] user->user_id = 11 VAL [user={-1:0}] [L971] user->timeout = 3 [L976] RET user_initialize() [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; VAL [user={-1:0}] [L978] e.primitive = _EVENT_START VAL [user={-1:0}] [L979] CALL event_precess(&e) VAL [e={7:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={7:0}, e={7:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [e={7:0}, e={7:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [e={7:0}, user={-1:0}] [L838] EXPR e->primitive [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [e={7:0}, e={7:0}, primitive=0, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\old(status)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\old(status)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\old(status)=2, status=2, user={-1:0}] [L815] COND TRUE user->status != status [L816] user->status = status [L817] return 10; VAL [\old(status)=2, \result=10, status=2, user={-1:0}] [L840] RET status_update(AS_START) VAL [e={7:0}, e={7:0}, primitive=0, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; VAL [e={6:0}, user={-1:0}] [L830] EXPR user->info VAL [e={6:0}, user={-1:0}] [L830] EXPR user->info->is_valid VAL [e={6:0}, user={-1:0}] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={6:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [e={6:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={6:0}, e={6:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [e={6:0}, e={6:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [e={6:0}, user={-1:0}] [L881] EXPR e->primitive [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: VAL [e={6:0}, e={6:0}, primitive=3, rc=-1, user={-1:0}] [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: VAL [e={6:0}, e={6:0}, primitive=3, rc=-1, user={-1:0}] [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [e={6:0}, e={6:0}, message={-1:16}, primitive=3, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) VAL [e={6:0}, e={6:0}, message={-3:0}, primitive=3, rc=-1, user={-1:0}] [L901] message->id = 3 - 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: -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: -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: 686]: 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: 973]: 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 10 procedures, 362 locations, 162 error locations. Started 1 CEGAR loops. OverallTime: 31.0s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8673 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8665 mSDsluCounter, 33204 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25208 mSDsCounter, 2490 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21908 IncrementalHoareTripleChecker+Invalid, 24398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2490 mSolverCounterUnsat, 7996 mSDtfsCounter, 21908 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1346occurred in iteration=27, InterpolantAutomatonStates: 277, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 1449 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 936 ConstructedInterpolants, 0 QuantifiedInterpolants, 5605 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1037 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 30 InterpolantComputations, 28 PerfectInterpolantSequences, 65/67 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! [2023-11-22 17:02:07,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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)