./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/memsafety-bftpd/bftpd_1.c -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 0559bc0079d827bb14d884d97cbfcf7bd195105509cc81ed196e15551b246678 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:22:04,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:22:04,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:22:04,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:22:04,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:22:04,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:22:04,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:22:04,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:22:04,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:22:04,610 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:22:04,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:22:04,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:22:04,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:22:04,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:22:04,611 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:22:04,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:22:04,612 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:22:04,613 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:22:04,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:22:04,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:22:04,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:04,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:04,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:04,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:04,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:22:04,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:04,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:04,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:04,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:04,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:22:04,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:22:04,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:22:04,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:22:04,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:22:04,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:22:04,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:22:04,615 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 0559bc0079d827bb14d884d97cbfcf7bd195105509cc81ed196e15551b246678 [2025-04-29 11:22:04,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:22:04,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:22:04,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:22:04,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:22:04,880 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:22:04,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_1.c [2025-04-29 11:22:06,190 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7c903be7/d52e5e6b47ad474cbc168c06e56a20e5/FLAG900d968d8 [2025-04-29 11:22:06,411 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:22:06,412 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-bftpd/bftpd_1.c [2025-04-29 11:22:06,414 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:06,414 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:06,421 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7c903be7/d52e5e6b47ad474cbc168c06e56a20e5/FLAG900d968d8 [2025-04-29 11:22:07,191 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7c903be7/d52e5e6b47ad474cbc168c06e56a20e5 [2025-04-29 11:22:07,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:22:07,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:22:07,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:07,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:22:07,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:22:07,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551e678a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07, skipping insertion in model container [2025-04-29 11:22:07,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:22:07,338 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:22:07,341 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:07,352 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:22:07,370 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:07,380 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:22:07,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07 WrapperNode [2025-04-29 11:22:07,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:07,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:07,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:22:07,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:22:07,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,411 INFO L138 Inliner]: procedures = 16, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2025-04-29 11:22:07,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:07,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:22:07,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:22:07,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:22:07,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,433 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [9, 6, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-04-29 11:22:07,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:22:07,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:22:07,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:22:07,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:22:07,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (1/1) ... [2025-04-29 11:22:07,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:07,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:07,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:22:07,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:22:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-04-29 11:22:07,495 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-04-29 11:22:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:22:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:22:07,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:22:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:22:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:22:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:22:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:22:07,578 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:22:07,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:22:07,729 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-04-29 11:22:07,729 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:22:07,735 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:22:07,735 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:22:07,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:07 BoogieIcfgContainer [2025-04-29 11:22:07,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:22:07,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:22:07,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:22:07,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:22:07,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:22:07" (1/3) ... [2025-04-29 11:22:07,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf5757d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:07, skipping insertion in model container [2025-04-29 11:22:07,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:07" (2/3) ... [2025-04-29 11:22:07,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf5757d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:07, skipping insertion in model container [2025-04-29 11:22:07,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:07" (3/3) ... [2025-04-29 11:22:07,741 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_1.c [2025-04-29 11:22:07,750 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:22:07,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_1.c that has 2 procedures, 67 locations, 78 edges, 1 initial locations, 1 loop locations, and 23 error locations. [2025-04-29 11:22:07,775 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:22:07,782 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@611ace71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:22:07,782 INFO L341 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-04-29 11:22:07,785 INFO L278 IsEmpty]: Start isEmpty. Operand has 67 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:22:07,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:07,788 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:07,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:07,789 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:07,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash -742867072, now seen corresponding path program 1 times [2025-04-29 11:22:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:07,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269135128] [2025-04-29 11:22:07,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:07,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:07,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:07,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:07,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:08,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:08,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269135128] [2025-04-29 11:22:08,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269135128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:08,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:08,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:08,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226787060] [2025-04-29 11:22:08,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:08,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:08,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:08,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:08,057 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:08,187 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2025-04-29 11:22:08,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:08,188 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:22:08,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:08,193 INFO L225 Difference]: With dead ends: 134 [2025-04-29 11:22:08,193 INFO L226 Difference]: Without dead ends: 128 [2025-04-29 11:22:08,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:08,197 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 113 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:08,197 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 127 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-29 11:22:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2025-04-29 11:22:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.646153846153846) internal successors, (107), 85 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-29 11:22:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2025-04-29 11:22:08,225 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 6 [2025-04-29 11:22:08,226 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:08,226 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2025-04-29 11:22:08,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:08,226 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2025-04-29 11:22:08,226 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:08,226 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:08,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:08,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:22:08,226 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:08,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:08,227 INFO L85 PathProgramCache]: Analyzing trace with hash -742867071, now seen corresponding path program 1 times [2025-04-29 11:22:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:08,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898404479] [2025-04-29 11:22:08,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:08,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:08,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:08,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:08,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:08,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898404479] [2025-04-29 11:22:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898404479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:08,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:08,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610706653] [2025-04-29 11:22:08,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:08,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:08,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:08,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:08,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:08,393 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:08,489 INFO L93 Difference]: Finished difference Result 195 states and 267 transitions. [2025-04-29 11:22:08,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:08,490 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:22:08,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:08,491 INFO L225 Difference]: With dead ends: 195 [2025-04-29 11:22:08,492 INFO L226 Difference]: Without dead ends: 195 [2025-04-29 11:22:08,493 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:08,493 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 88 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:08,494 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 207 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-29 11:22:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 169. [2025-04-29 11:22:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 151 states have internal predecessors, (218), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 263 transitions. [2025-04-29 11:22:08,513 INFO L79 Accepts]: Start accepts. Automaton has 169 states and 263 transitions. Word has length 6 [2025-04-29 11:22:08,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:08,513 INFO L485 AbstractCegarLoop]: Abstraction has 169 states and 263 transitions. [2025-04-29 11:22:08,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:08,514 INFO L278 IsEmpty]: Start isEmpty. Operand 169 states and 263 transitions. [2025-04-29 11:22:08,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:22:08,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:08,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:08,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:22:08,514 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:08,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1554042775, now seen corresponding path program 1 times [2025-04-29 11:22:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:08,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300677540] [2025-04-29 11:22:08,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:08,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:22:08,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:22:08,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:08,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:08,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:08,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300677540] [2025-04-29 11:22:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300677540] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:08,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:08,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:08,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649065445] [2025-04-29 11:22:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:08,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:08,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:08,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:08,682 INFO L87 Difference]: Start difference. First operand 169 states and 263 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:08,812 INFO L93 Difference]: Finished difference Result 220 states and 318 transitions. [2025-04-29 11:22:08,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:08,812 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:22:08,812 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:08,814 INFO L225 Difference]: With dead ends: 220 [2025-04-29 11:22:08,816 INFO L226 Difference]: Without dead ends: 220 [2025-04-29 11:22:08,816 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:08,817 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:08,817 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 181 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-04-29 11:22:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 172. [2025-04-29 11:22:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 154 states have internal predecessors, (221), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 266 transitions. [2025-04-29 11:22:08,835 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 266 transitions. Word has length 7 [2025-04-29 11:22:08,835 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:08,835 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 266 transitions. [2025-04-29 11:22:08,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:08,835 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 266 transitions. [2025-04-29 11:22:08,836 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:22:08,836 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:08,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:08,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:22:08,836 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:08,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash -930685728, now seen corresponding path program 1 times [2025-04-29 11:22:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:08,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987860419] [2025-04-29 11:22:08,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:08,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:22:08,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:22:08,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:08,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:09,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:09,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987860419] [2025-04-29 11:22:09,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987860419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:09,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:09,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148295846] [2025-04-29 11:22:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:09,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:09,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:09,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:09,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:09,006 INFO L87 Difference]: Start difference. First operand 172 states and 266 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:09,098 INFO L93 Difference]: Finished difference Result 197 states and 268 transitions. [2025-04-29 11:22:09,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:09,099 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-29 11:22:09,099 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:09,100 INFO L225 Difference]: With dead ends: 197 [2025-04-29 11:22:09,101 INFO L226 Difference]: Without dead ends: 197 [2025-04-29 11:22:09,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:09,101 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 82 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:09,101 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 201 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-04-29 11:22:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 172. [2025-04-29 11:22:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 154 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2025-04-29 11:22:09,117 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 8 [2025-04-29 11:22:09,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:09,117 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2025-04-29 11:22:09,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:09,117 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2025-04-29 11:22:09,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:22:09,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:09,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:09,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:22:09,118 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:09,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1213513547, now seen corresponding path program 1 times [2025-04-29 11:22:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:09,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435058694] [2025-04-29 11:22:09,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:09,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:09,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:22:09,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:22:09,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:09,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:09,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:09,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435058694] [2025-04-29 11:22:09,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435058694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:09,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:09,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:09,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101993169] [2025-04-29 11:22:09,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:09,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:09,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:09,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:09,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:09,183 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:09,289 INFO L93 Difference]: Finished difference Result 266 states and 366 transitions. [2025-04-29 11:22:09,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:09,289 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:22:09,289 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:09,291 INFO L225 Difference]: With dead ends: 266 [2025-04-29 11:22:09,291 INFO L226 Difference]: Without dead ends: 266 [2025-04-29 11:22:09,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:09,291 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 145 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:09,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 204 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:09,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-04-29 11:22:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 205. [2025-04-29 11:22:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.606060606060606) internal successors, (265), 186 states have internal predecessors, (265), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 310 transitions. [2025-04-29 11:22:09,307 INFO L79 Accepts]: Start accepts. Automaton has 205 states and 310 transitions. Word has length 9 [2025-04-29 11:22:09,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:09,307 INFO L485 AbstractCegarLoop]: Abstraction has 205 states and 310 transitions. [2025-04-29 11:22:09,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:09,307 INFO L278 IsEmpty]: Start isEmpty. Operand 205 states and 310 transitions. [2025-04-29 11:22:09,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:22:09,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:09,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:09,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:22:09,308 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:09,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1035785662, now seen corresponding path program 1 times [2025-04-29 11:22:09,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:09,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089192252] [2025-04-29 11:22:09,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:09,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:09,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:22:09,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:22:09,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:09,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:09,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:09,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089192252] [2025-04-29 11:22:09,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089192252] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:09,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:09,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5623697] [2025-04-29 11:22:09,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:09,400 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:09,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:09,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:09,401 INFO L87 Difference]: Start difference. First operand 205 states and 310 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:09,495 INFO L93 Difference]: Finished difference Result 253 states and 333 transitions. [2025-04-29 11:22:09,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:09,495 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:22:09,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:09,497 INFO L225 Difference]: With dead ends: 253 [2025-04-29 11:22:09,498 INFO L226 Difference]: Without dead ends: 253 [2025-04-29 11:22:09,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:09,498 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 138 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:09,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 232 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-29 11:22:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 219. [2025-04-29 11:22:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 178 states have (on average 1.6067415730337078) internal successors, (286), 200 states have internal predecessors, (286), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 331 transitions. [2025-04-29 11:22:09,511 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 331 transitions. Word has length 10 [2025-04-29 11:22:09,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:09,511 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 331 transitions. [2025-04-29 11:22:09,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:09,511 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 331 transitions. [2025-04-29 11:22:09,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:22:09,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:09,512 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:09,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:22:09,512 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:09,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1014350664, now seen corresponding path program 1 times [2025-04-29 11:22:09,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:09,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5676680] [2025-04-29 11:22:09,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:09,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:09,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:09,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:09,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:09,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:09,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:09,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5676680] [2025-04-29 11:22:09,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5676680] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:09,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922494421] [2025-04-29 11:22:09,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:09,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:09,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:09,639 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) [2025-04-29 11:22:09,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:22:09,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:09,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:09,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:09,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:09,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:22:09,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:09,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:09,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922494421] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:09,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:09,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-04-29 11:22:09,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748241295] [2025-04-29 11:22:09,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:09,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:22:09,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:09,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:22:09,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:22:09,935 INFO L87 Difference]: Start difference. First operand 219 states and 331 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:10,125 INFO L93 Difference]: Finished difference Result 245 states and 330 transitions. [2025-04-29 11:22:10,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:10,125 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:22:10,125 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:10,127 INFO L225 Difference]: With dead ends: 245 [2025-04-29 11:22:10,127 INFO L226 Difference]: Without dead ends: 245 [2025-04-29 11:22:10,127 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:22:10,128 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 253 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:10,129 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 537 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-29 11:22:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 222. [2025-04-29 11:22:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 203 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 325 transitions. [2025-04-29 11:22:10,140 INFO L79 Accepts]: Start accepts. Automaton has 222 states and 325 transitions. Word has length 14 [2025-04-29 11:22:10,140 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:10,140 INFO L485 AbstractCegarLoop]: Abstraction has 222 states and 325 transitions. [2025-04-29 11:22:10,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:10,141 INFO L278 IsEmpty]: Start isEmpty. Operand 222 states and 325 transitions. [2025-04-29 11:22:10,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:22:10,141 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:10,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:10,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:10,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:10,346 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:10,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1380099458, now seen corresponding path program 1 times [2025-04-29 11:22:10,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:10,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078670897] [2025-04-29 11:22:10,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:10,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:10,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:22:10,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:22:10,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:10,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:10,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:10,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078670897] [2025-04-29 11:22:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078670897] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:10,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887186617] [2025-04-29 11:22:10,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:10,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:10,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:10,462 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) [2025-04-29 11:22:10,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:22:10,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:22:10,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:22:10,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:10,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:10,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:22:10,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:10,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:10,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887186617] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:10,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:10,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-04-29 11:22:10,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616060046] [2025-04-29 11:22:10,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:10,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:22:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:10,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:22:10,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:22:10,706 INFO L87 Difference]: Start difference. First operand 222 states and 325 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:10,925 INFO L93 Difference]: Finished difference Result 271 states and 376 transitions. [2025-04-29 11:22:10,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:22:10,926 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:22:10,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:10,927 INFO L225 Difference]: With dead ends: 271 [2025-04-29 11:22:10,927 INFO L226 Difference]: Without dead ends: 271 [2025-04-29 11:22:10,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:22:10,927 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 151 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:10,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 388 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-04-29 11:22:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 230. [2025-04-29 11:22:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 189 states have (on average 1.5396825396825398) internal successors, (291), 211 states have internal predecessors, (291), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-29 11:22:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2025-04-29 11:22:10,934 INFO L79 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 15 [2025-04-29 11:22:10,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:10,934 INFO L485 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2025-04-29 11:22:10,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:10,935 INFO L278 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2025-04-29 11:22:10,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:22:10,935 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:10,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:10,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:22:11,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-29 11:22:11,136 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:11,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash -166589721, now seen corresponding path program 1 times [2025-04-29 11:22:11,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:11,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567025922] [2025-04-29 11:22:11,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:11,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:11,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:11,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:11,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:11,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:11,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567025922] [2025-04-29 11:22:11,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567025922] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:11,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806231146] [2025-04-29 11:22:11,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:11,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:11,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:11,281 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:11,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:22:11,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:11,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:11,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:11,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:11,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:22:11,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:11,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:11,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806231146] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:11,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:11,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-04-29 11:22:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185702636] [2025-04-29 11:22:11,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:11,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:22:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:11,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:22:11,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:22:11,578 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:11,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:11,987 INFO L93 Difference]: Finished difference Result 393 states and 539 transitions. [2025-04-29 11:22:11,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:22:11,988 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:22:11,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:11,989 INFO L225 Difference]: With dead ends: 393 [2025-04-29 11:22:11,989 INFO L226 Difference]: Without dead ends: 393 [2025-04-29 11:22:11,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:22:11,990 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 256 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:11,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 749 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:22:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-04-29 11:22:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 325. [2025-04-29 11:22:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 300 states have internal predecessors, (438), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2025-04-29 11:22:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2025-04-29 11:22:11,999 INFO L79 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 16 [2025-04-29 11:22:11,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:11,999 INFO L485 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2025-04-29 11:22:11,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:12,000 INFO L278 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2025-04-29 11:22:12,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:12,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:12,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:12,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:12,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:12,201 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:12,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:12,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1018139209, now seen corresponding path program 1 times [2025-04-29 11:22:12,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:12,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700769480] [2025-04-29 11:22:12,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:12,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:12,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:12,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:12,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:12,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700769480] [2025-04-29 11:22:12,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700769480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:12,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:12,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:22:12,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113767133] [2025-04-29 11:22:12,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:12,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:12,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:12,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:12,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:12,238 INFO L87 Difference]: Start difference. First operand 325 states and 502 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:12,258 INFO L93 Difference]: Finished difference Result 471 states and 732 transitions. [2025-04-29 11:22:12,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:12,260 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:22:12,260 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:12,262 INFO L225 Difference]: With dead ends: 471 [2025-04-29 11:22:12,262 INFO L226 Difference]: Without dead ends: 471 [2025-04-29 11:22:12,262 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:12,262 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:12,263 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 112 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-04-29 11:22:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 457. [2025-04-29 11:22:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 398 states have (on average 1.5728643216080402) internal successors, (626), 423 states have internal predecessors, (626), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2025-04-29 11:22:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 730 transitions. [2025-04-29 11:22:12,285 INFO L79 Accepts]: Start accepts. Automaton has 457 states and 730 transitions. Word has length 18 [2025-04-29 11:22:12,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:12,285 INFO L485 AbstractCegarLoop]: Abstraction has 457 states and 730 transitions. [2025-04-29 11:22:12,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:12,285 INFO L278 IsEmpty]: Start isEmpty. Operand 457 states and 730 transitions. [2025-04-29 11:22:12,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:12,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:12,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:12,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:22:12,287 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:12,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:12,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1018139465, now seen corresponding path program 1 times [2025-04-29 11:22:12,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:12,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000745170] [2025-04-29 11:22:12,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:12,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:12,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:12,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:12,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:12,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:12,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:12,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000745170] [2025-04-29 11:22:12,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000745170] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:12,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:12,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:12,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365712139] [2025-04-29 11:22:12,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:12,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:12,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:12,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:12,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:12,315 INFO L87 Difference]: Start difference. First operand 457 states and 730 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:12,321 INFO L93 Difference]: Finished difference Result 419 states and 664 transitions. [2025-04-29 11:22:12,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:12,321 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:22:12,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:12,323 INFO L225 Difference]: With dead ends: 419 [2025-04-29 11:22:12,323 INFO L226 Difference]: Without dead ends: 419 [2025-04-29 11:22:12,324 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:12,324 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:12,324 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-04-29 11:22:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-04-29 11:22:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 366 states have (on average 1.530054644808743) internal successors, (560), 385 states have internal predecessors, (560), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2025-04-29 11:22:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 664 transitions. [2025-04-29 11:22:12,342 INFO L79 Accepts]: Start accepts. Automaton has 419 states and 664 transitions. Word has length 18 [2025-04-29 11:22:12,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:12,342 INFO L485 AbstractCegarLoop]: Abstraction has 419 states and 664 transitions. [2025-04-29 11:22:12,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:12,342 INFO L278 IsEmpty]: Start isEmpty. Operand 419 states and 664 transitions. [2025-04-29 11:22:12,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:22:12,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:12,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:12,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:22:12,343 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:12,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1497544475, now seen corresponding path program 1 times [2025-04-29 11:22:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:12,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69848477] [2025-04-29 11:22:12,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:12,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:22:12,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:22:12,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:12,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:12,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:12,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69848477] [2025-04-29 11:22:12,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69848477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:12,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:12,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:22:12,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187191272] [2025-04-29 11:22:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:12,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:12,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:12,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:12,411 INFO L87 Difference]: Start difference. First operand 419 states and 664 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:12,437 INFO L93 Difference]: Finished difference Result 435 states and 668 transitions. [2025-04-29 11:22:12,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:12,437 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:22:12,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:12,439 INFO L225 Difference]: With dead ends: 435 [2025-04-29 11:22:12,439 INFO L226 Difference]: Without dead ends: 435 [2025-04-29 11:22:12,439 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:12,439 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:12,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 90 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-04-29 11:22:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 422. [2025-04-29 11:22:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 369 states have (on average 1.5176151761517616) internal successors, (560), 388 states have internal predecessors, (560), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2025-04-29 11:22:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 664 transitions. [2025-04-29 11:22:12,451 INFO L79 Accepts]: Start accepts. Automaton has 422 states and 664 transitions. Word has length 19 [2025-04-29 11:22:12,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:12,451 INFO L485 AbstractCegarLoop]: Abstraction has 422 states and 664 transitions. [2025-04-29 11:22:12,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:12,451 INFO L278 IsEmpty]: Start isEmpty. Operand 422 states and 664 transitions. [2025-04-29 11:22:12,451 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:22:12,451 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:12,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:12,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:22:12,451 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:12,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash -820761461, now seen corresponding path program 1 times [2025-04-29 11:22:12,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:12,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034546075] [2025-04-29 11:22:12,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:12,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:22:12,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:22:12,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:12,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:12,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:12,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034546075] [2025-04-29 11:22:12,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034546075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:12,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:12,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:22:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578944357] [2025-04-29 11:22:12,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:12,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:12,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:12,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:12,479 INFO L87 Difference]: Start difference. First operand 422 states and 664 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:12,500 INFO L93 Difference]: Finished difference Result 487 states and 744 transitions. [2025-04-29 11:22:12,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:12,500 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:22:12,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:12,502 INFO L225 Difference]: With dead ends: 487 [2025-04-29 11:22:12,502 INFO L226 Difference]: Without dead ends: 487 [2025-04-29 11:22:12,502 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:12,503 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:12,503 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 101 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-04-29 11:22:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 473. [2025-04-29 11:22:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 416 states have (on average 1.5144230769230769) internal successors, (630), 437 states have internal predecessors, (630), 20 states have call successors, (20), 15 states have call predecessors, (20), 22 states have return successors, (89), 20 states have call predecessors, (89), 20 states have call successors, (89) [2025-04-29 11:22:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 739 transitions. [2025-04-29 11:22:12,520 INFO L79 Accepts]: Start accepts. Automaton has 473 states and 739 transitions. Word has length 20 [2025-04-29 11:22:12,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:12,520 INFO L485 AbstractCegarLoop]: Abstraction has 473 states and 739 transitions. [2025-04-29 11:22:12,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:12,521 INFO L278 IsEmpty]: Start isEmpty. Operand 473 states and 739 transitions. [2025-04-29 11:22:12,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:22:12,522 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:12,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:12,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:22:12,522 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:12,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash 797664614, now seen corresponding path program 1 times [2025-04-29 11:22:12,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:12,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450461906] [2025-04-29 11:22:12,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:12,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:12,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:22:12,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:22:12,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:12,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:12,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:12,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450461906] [2025-04-29 11:22:12,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450461906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:12,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:12,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:12,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370550796] [2025-04-29 11:22:12,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:12,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:12,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:12,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:12,572 INFO L87 Difference]: Start difference. First operand 473 states and 739 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:12,578 INFO L93 Difference]: Finished difference Result 339 states and 511 transitions. [2025-04-29 11:22:12,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:12,579 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-04-29 11:22:12,579 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:12,580 INFO L225 Difference]: With dead ends: 339 [2025-04-29 11:22:12,580 INFO L226 Difference]: Without dead ends: 339 [2025-04-29 11:22:12,581 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:12,581 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 9 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:12,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 100 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-04-29 11:22:12,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-04-29 11:22:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 294 states have (on average 1.4863945578231292) internal successors, (437), 312 states have internal predecessors, (437), 15 states have call successors, (15), 11 states have call predecessors, (15), 15 states have return successors, (59), 15 states have call predecessors, (59), 15 states have call successors, (59) [2025-04-29 11:22:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 511 transitions. [2025-04-29 11:22:12,592 INFO L79 Accepts]: Start accepts. Automaton has 339 states and 511 transitions. Word has length 25 [2025-04-29 11:22:12,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:12,592 INFO L485 AbstractCegarLoop]: Abstraction has 339 states and 511 transitions. [2025-04-29 11:22:12,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:12,592 INFO L278 IsEmpty]: Start isEmpty. Operand 339 states and 511 transitions. [2025-04-29 11:22:12,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:22:12,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:12,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:12,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:22:12,596 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:12,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash 233552810, now seen corresponding path program 1 times [2025-04-29 11:22:12,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:12,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218394246] [2025-04-29 11:22:12,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:12,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:12,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:22:12,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:22:12,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:12,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:12,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:12,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218394246] [2025-04-29 11:22:12,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218394246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:12,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596279204] [2025-04-29 11:22:12,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:12,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:12,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:22:12,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:22:12,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:22:12,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:12,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:12,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:22:12,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:13,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:13,036 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-04-29 11:22:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:13,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:13,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596279204] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:13,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:13,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2025-04-29 11:22:13,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362513578] [2025-04-29 11:22:13,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:13,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:22:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:13,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:22:13,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:22:13,189 INFO L87 Difference]: Start difference. First operand 339 states and 511 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:13,494 INFO L93 Difference]: Finished difference Result 372 states and 528 transitions. [2025-04-29 11:22:13,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:22:13,499 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-04-29 11:22:13,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:13,500 INFO L225 Difference]: With dead ends: 372 [2025-04-29 11:22:13,500 INFO L226 Difference]: Without dead ends: 372 [2025-04-29 11:22:13,501 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:22:13,501 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 334 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:13,501 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 135 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-04-29 11:22:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2025-04-29 11:22:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 312 states have (on average 1.4326923076923077) internal successors, (447), 334 states have internal predecessors, (447), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2025-04-29 11:22:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 522 transitions. [2025-04-29 11:22:13,519 INFO L79 Accepts]: Start accepts. Automaton has 361 states and 522 transitions. Word has length 27 [2025-04-29 11:22:13,519 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:13,519 INFO L485 AbstractCegarLoop]: Abstraction has 361 states and 522 transitions. [2025-04-29 11:22:13,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:13,520 INFO L278 IsEmpty]: Start isEmpty. Operand 361 states and 522 transitions. [2025-04-29 11:22:13,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:22:13,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:13,520 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:13,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:22:13,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:22:13,721 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:13,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1734013005, now seen corresponding path program 1 times [2025-04-29 11:22:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:13,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797538266] [2025-04-29 11:22:13,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:13,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:13,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:22:13,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:22:13,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:13,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:13,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:13,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797538266] [2025-04-29 11:22:13,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797538266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:13,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327749679] [2025-04-29 11:22:13,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:13,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:13,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:13,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:13,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:22:13,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:22:13,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:22:13,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:13,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:13,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:22:13,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:13,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:13,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327749679] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:13,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:22:13,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-04-29 11:22:13,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364677769] [2025-04-29 11:22:13,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:13,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:13,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:13,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:13,962 INFO L87 Difference]: Start difference. First operand 361 states and 522 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:14,008 INFO L93 Difference]: Finished difference Result 385 states and 542 transitions. [2025-04-29 11:22:14,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:22:14,008 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-04-29 11:22:14,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:14,010 INFO L225 Difference]: With dead ends: 385 [2025-04-29 11:22:14,010 INFO L226 Difference]: Without dead ends: 385 [2025-04-29 11:22:14,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:14,010 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 61 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:14,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 158 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-04-29 11:22:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 374. [2025-04-29 11:22:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 325 states have (on average 1.4153846153846155) internal successors, (460), 347 states have internal predecessors, (460), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2025-04-29 11:22:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 535 transitions. [2025-04-29 11:22:14,018 INFO L79 Accepts]: Start accepts. Automaton has 374 states and 535 transitions. Word has length 28 [2025-04-29 11:22:14,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:14,019 INFO L485 AbstractCegarLoop]: Abstraction has 374 states and 535 transitions. [2025-04-29 11:22:14,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:14,019 INFO L278 IsEmpty]: Start isEmpty. Operand 374 states and 535 transitions. [2025-04-29 11:22:14,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:22:14,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:14,019 INFO L218 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] [2025-04-29 11:22:14,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:14,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:22:14,220 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:14,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:14,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1105949385, now seen corresponding path program 1 times [2025-04-29 11:22:14,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:14,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826556859] [2025-04-29 11:22:14,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:14,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:14,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:22:14,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:22:14,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:14,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:14,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:14,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826556859] [2025-04-29 11:22:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826556859] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:14,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5751715] [2025-04-29 11:22:14,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:14,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:14,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:14,513 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:14,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:22:14,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:22:14,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:22:14,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:14,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:14,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:22:14,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:14,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:14,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-04-29 11:22:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:14,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5751715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:15,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:15,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2025-04-29 11:22:15,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472834228] [2025-04-29 11:22:15,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:15,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:22:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:15,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:22:15,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:22:15,018 INFO L87 Difference]: Start difference. First operand 374 states and 535 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:15,410 INFO L93 Difference]: Finished difference Result 384 states and 536 transitions. [2025-04-29 11:22:15,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:22:15,410 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-04-29 11:22:15,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:15,412 INFO L225 Difference]: With dead ends: 384 [2025-04-29 11:22:15,412 INFO L226 Difference]: Without dead ends: 384 [2025-04-29 11:22:15,412 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:22:15,413 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 153 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:15,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 252 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:22:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-04-29 11:22:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 377. [2025-04-29 11:22:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 328 states have (on average 1.396341463414634) internal successors, (458), 350 states have internal predecessors, (458), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2025-04-29 11:22:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 533 transitions. [2025-04-29 11:22:15,420 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 533 transitions. Word has length 29 [2025-04-29 11:22:15,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:15,420 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 533 transitions. [2025-04-29 11:22:15,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:15,420 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 533 transitions. [2025-04-29 11:22:15,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:22:15,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:15,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:15,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:22:15,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:22:15,622 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:15,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash -650854345, now seen corresponding path program 1 times [2025-04-29 11:22:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:15,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448051588] [2025-04-29 11:22:15,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:15,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:15,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:15,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:15,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:15,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:15,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448051588] [2025-04-29 11:22:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448051588] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:15,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307308780] [2025-04-29 11:22:15,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:15,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:15,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:15,800 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:15,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:22:15,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:15,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:15,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:15,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:15,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:22:15,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:15,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:15,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307308780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:15,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:22:15,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2025-04-29 11:22:15,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814334857] [2025-04-29 11:22:15,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:15,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:15,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:15,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:22:15,901 INFO L87 Difference]: Start difference. First operand 377 states and 533 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:15,971 INFO L93 Difference]: Finished difference Result 366 states and 497 transitions. [2025-04-29 11:22:15,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:22:15,971 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-04-29 11:22:15,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:15,972 INFO L225 Difference]: With dead ends: 366 [2025-04-29 11:22:15,972 INFO L226 Difference]: Without dead ends: 365 [2025-04-29 11:22:15,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:22:15,973 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 89 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:15,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 175 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-04-29 11:22:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2025-04-29 11:22:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 313 states have (on average 1.3993610223642172) internal successors, (438), 336 states have internal predecessors, (438), 12 states have call successors, (12), 9 states have call predecessors, (12), 18 states have return successors, (42), 12 states have call predecessors, (42), 12 states have call successors, (42) [2025-04-29 11:22:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 492 transitions. [2025-04-29 11:22:15,979 INFO L79 Accepts]: Start accepts. Automaton has 358 states and 492 transitions. Word has length 30 [2025-04-29 11:22:15,979 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:15,979 INFO L485 AbstractCegarLoop]: Abstraction has 358 states and 492 transitions. [2025-04-29 11:22:15,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:15,979 INFO L278 IsEmpty]: Start isEmpty. Operand 358 states and 492 transitions. [2025-04-29 11:22:15,980 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:22:15,980 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:15,980 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-29 11:22:15,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:22:16,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:16,184 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:16,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash -75307390, now seen corresponding path program 1 times [2025-04-29 11:22:16,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:16,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418957829] [2025-04-29 11:22:16,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:16,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:16,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:16,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:16,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:16,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:16,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:16,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418957829] [2025-04-29 11:22:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418957829] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:16,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325797439] [2025-04-29 11:22:16,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:16,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:16,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:16,294 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:16,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:22:16,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:16,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:16,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:16,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:16,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 11:22:16,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:16,367 WARN L871 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (and (= (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (select |c_#valid| |parse_input_c1_~x~0#1.base|))))) is different from true [2025-04-29 11:22:16,398 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:16,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:22:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:16,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:16,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325797439] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:16,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:16,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-04-29 11:22:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129103740] [2025-04-29 11:22:16,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:16,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:22:16,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:16,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:22:16,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2025-04-29 11:22:16,467 INFO L87 Difference]: Start difference. First operand 358 states and 492 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:22:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:16,723 INFO L93 Difference]: Finished difference Result 488 states and 623 transitions. [2025-04-29 11:22:16,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:22:16,723 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-04-29 11:22:16,723 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:16,724 INFO L225 Difference]: With dead ends: 488 [2025-04-29 11:22:16,724 INFO L226 Difference]: Without dead ends: 488 [2025-04-29 11:22:16,725 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=394, Unknown=1, NotChecked=44, Total=600 [2025-04-29 11:22:16,725 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 370 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:16,725 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 290 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 237 Invalid, 0 Unknown, 157 Unchecked, 0.1s Time] [2025-04-29 11:22:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-04-29 11:22:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 433. [2025-04-29 11:22:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 385 states have (on average 1.3636363636363635) internal successors, (525), 409 states have internal predecessors, (525), 12 states have call successors, (12), 11 states have call predecessors, (12), 21 states have return successors, (41), 12 states have call predecessors, (41), 12 states have call successors, (41) [2025-04-29 11:22:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 578 transitions. [2025-04-29 11:22:16,736 INFO L79 Accepts]: Start accepts. Automaton has 433 states and 578 transitions. Word has length 30 [2025-04-29 11:22:16,736 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:16,736 INFO L485 AbstractCegarLoop]: Abstraction has 433 states and 578 transitions. [2025-04-29 11:22:16,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:22:16,736 INFO L278 IsEmpty]: Start isEmpty. Operand 433 states and 578 transitions. [2025-04-29 11:22:16,737 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:22:16,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:16,737 INFO L218 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] [2025-04-29 11:22:16,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:22:16,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:16,941 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:16,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1960438251, now seen corresponding path program 1 times [2025-04-29 11:22:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:16,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941904641] [2025-04-29 11:22:16,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:16,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:16,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:22:16,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:22:16,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:16,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:17,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941904641] [2025-04-29 11:22:17,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941904641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:17,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170769038] [2025-04-29 11:22:17,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:17,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:17,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:17,084 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:17,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:22:17,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:22:17,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:22:17,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:17,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:17,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:22:17,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:17,190 WARN L871 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (and (= (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| (select |c_#length| |parse_input_c1_~x~0#1.base|)) |c_#length|))) is different from true [2025-04-29 11:22:17,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:17,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-04-29 11:22:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:17,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:17,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170769038] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:17,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:17,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2025-04-29 11:22:17,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420911679] [2025-04-29 11:22:17,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:17,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:22:17,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:17,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:22:17,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=247, Unknown=1, NotChecked=32, Total=342 [2025-04-29 11:22:17,364 INFO L87 Difference]: Start difference. First operand 433 states and 578 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:17,822 INFO L93 Difference]: Finished difference Result 589 states and 726 transitions. [2025-04-29 11:22:17,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:22:17,822 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-04-29 11:22:17,822 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:17,824 INFO L225 Difference]: With dead ends: 589 [2025-04-29 11:22:17,824 INFO L226 Difference]: Without dead ends: 589 [2025-04-29 11:22:17,824 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=949, Unknown=1, NotChecked=68, Total=1332 [2025-04-29 11:22:17,825 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 500 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:17,825 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 277 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 319 Invalid, 0 Unknown, 168 Unchecked, 0.2s Time] [2025-04-29 11:22:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-04-29 11:22:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 534. [2025-04-29 11:22:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 481 states have (on average 1.345114345114345) internal successors, (647), 509 states have internal predecessors, (647), 12 states have call successors, (12), 12 states have call predecessors, (12), 26 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-04-29 11:22:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 695 transitions. [2025-04-29 11:22:17,837 INFO L79 Accepts]: Start accepts. Automaton has 534 states and 695 transitions. Word has length 31 [2025-04-29 11:22:17,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:17,837 INFO L485 AbstractCegarLoop]: Abstraction has 534 states and 695 transitions. [2025-04-29 11:22:17,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:17,838 INFO L278 IsEmpty]: Start isEmpty. Operand 534 states and 695 transitions. [2025-04-29 11:22:17,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:22:17,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:17,838 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-04-29 11:22:17,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:22:18,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:18,039 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:18,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:18,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1088587377, now seen corresponding path program 1 times [2025-04-29 11:22:18,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:18,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751461796] [2025-04-29 11:22:18,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:18,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:22:18,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:22:18,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:18,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:18,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:18,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751461796] [2025-04-29 11:22:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751461796] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:18,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176182525] [2025-04-29 11:22:18,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:18,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:18,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:18,201 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:18,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:22:18,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:22:18,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:22:18,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:18,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:18,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:22:18,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:18,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:18,425 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-04-29 11:22:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:18,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:18,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176182525] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:18,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2025-04-29 11:22:18,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554213531] [2025-04-29 11:22:18,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:18,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:22:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:18,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:22:18,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:22:18,673 INFO L87 Difference]: Start difference. First operand 534 states and 695 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:19,113 INFO L93 Difference]: Finished difference Result 551 states and 689 transitions. [2025-04-29 11:22:19,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:22:19,114 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-04-29 11:22:19,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:19,115 INFO L225 Difference]: With dead ends: 551 [2025-04-29 11:22:19,115 INFO L226 Difference]: Without dead ends: 551 [2025-04-29 11:22:19,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:22:19,117 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 394 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:19,117 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 213 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-04-29 11:22:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 533. [2025-04-29 11:22:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 483 states have (on average 1.2939958592132506) internal successors, (625), 508 states have internal predecessors, (625), 12 states have call successors, (12), 12 states have call predecessors, (12), 26 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-04-29 11:22:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 673 transitions. [2025-04-29 11:22:19,126 INFO L79 Accepts]: Start accepts. Automaton has 533 states and 673 transitions. Word has length 35 [2025-04-29 11:22:19,126 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:19,126 INFO L485 AbstractCegarLoop]: Abstraction has 533 states and 673 transitions. [2025-04-29 11:22:19,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:22:19,126 INFO L278 IsEmpty]: Start isEmpty. Operand 533 states and 673 transitions. [2025-04-29 11:22:19,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:22:19,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:19,127 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-04-29 11:22:19,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:19,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-29 11:22:19,331 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:19,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:19,331 INFO L85 PathProgramCache]: Analyzing trace with hash 900846804, now seen corresponding path program 1 times [2025-04-29 11:22:19,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:19,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000571572] [2025-04-29 11:22:19,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:19,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:22:19,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:22:19,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:19,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:22:19,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:19,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000571572] [2025-04-29 11:22:19,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000571572] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:19,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840276508] [2025-04-29 11:22:19,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:19,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:19,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:19,417 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:19,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:22:19,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:22:19,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:22:19,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:19,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:19,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:22:19,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:19,592 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:19,592 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:22:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:22:19,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:19,682 INFO L354 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 24 treesize of output 20 [2025-04-29 11:22:19,827 INFO L354 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 24 treesize of output 20 [2025-04-29 11:22:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:22:19,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840276508] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:19,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:19,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2025-04-29 11:22:19,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302649995] [2025-04-29 11:22:19,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:19,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:22:19,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:19,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:22:19,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:22:19,846 INFO L87 Difference]: Start difference. First operand 533 states and 673 transitions. Second operand has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:22:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:20,087 INFO L93 Difference]: Finished difference Result 581 states and 706 transitions. [2025-04-29 11:22:20,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:22:20,090 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2025-04-29 11:22:20,090 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:20,092 INFO L225 Difference]: With dead ends: 581 [2025-04-29 11:22:20,092 INFO L226 Difference]: Without dead ends: 581 [2025-04-29 11:22:20,092 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:22:20,093 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 212 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:20,093 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 237 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-04-29 11:22:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 540. [2025-04-29 11:22:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 491 states have (on average 1.2932790224032586) internal successors, (635), 515 states have internal predecessors, (635), 12 states have call successors, (12), 12 states have call predecessors, (12), 25 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2025-04-29 11:22:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 680 transitions. [2025-04-29 11:22:20,101 INFO L79 Accepts]: Start accepts. Automaton has 540 states and 680 transitions. Word has length 36 [2025-04-29 11:22:20,101 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:20,101 INFO L485 AbstractCegarLoop]: Abstraction has 540 states and 680 transitions. [2025-04-29 11:22:20,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:22:20,102 INFO L278 IsEmpty]: Start isEmpty. Operand 540 states and 680 transitions. [2025-04-29 11:22:20,102 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:22:20,102 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:20,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-04-29 11:22:20,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:20,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-29 11:22:20,303 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:20,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:20,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2138520171, now seen corresponding path program 1 times [2025-04-29 11:22:20,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:20,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126828943] [2025-04-29 11:22:20,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:20,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:20,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:22:20,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:22:20,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:20,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:20,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:20,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126828943] [2025-04-29 11:22:20,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126828943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:20,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831105411] [2025-04-29 11:22:20,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:20,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:20,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:20,648 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:20,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:22:20,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:22:20,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:22:20,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:20,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:20,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:22:20,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:20,932 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:20,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831105411] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:21,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 25 [2025-04-29 11:22:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821259864] [2025-04-29 11:22:21,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:21,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 11:22:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:21,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 11:22:21,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:22:21,107 INFO L87 Difference]: Start difference. First operand 540 states and 680 transitions. Second operand has 26 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:22:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:22,356 INFO L93 Difference]: Finished difference Result 804 states and 973 transitions. [2025-04-29 11:22:22,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-29 11:22:22,357 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2025-04-29 11:22:22,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:22,359 INFO L225 Difference]: With dead ends: 804 [2025-04-29 11:22:22,359 INFO L226 Difference]: Without dead ends: 804 [2025-04-29 11:22:22,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=686, Invalid=3220, Unknown=0, NotChecked=0, Total=3906 [2025-04-29 11:22:22,360 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 828 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:22,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 495 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:22:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-04-29 11:22:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 544. [2025-04-29 11:22:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 497 states have (on average 1.283702213279678) internal successors, (638), 521 states have internal predecessors, (638), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-04-29 11:22:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 680 transitions. [2025-04-29 11:22:22,371 INFO L79 Accepts]: Start accepts. Automaton has 544 states and 680 transitions. Word has length 37 [2025-04-29 11:22:22,371 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:22,371 INFO L485 AbstractCegarLoop]: Abstraction has 544 states and 680 transitions. [2025-04-29 11:22:22,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:22:22,371 INFO L278 IsEmpty]: Start isEmpty. Operand 544 states and 680 transitions. [2025-04-29 11:22:22,371 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:22:22,371 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:22,372 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:22,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:22:22,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 11:22:22,576 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:22,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:22,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1062943796, now seen corresponding path program 1 times [2025-04-29 11:22:22,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:22,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6215082] [2025-04-29 11:22:22,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:22,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:22,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:22:22,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:22:22,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:22,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:22,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:22,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6215082] [2025-04-29 11:22:22,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6215082] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:22,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210820091] [2025-04-29 11:22:22,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:22,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:22,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:22,617 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:22,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:22:22,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:22:22,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:22:22,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:22,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:22,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:22:22,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:22,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:22,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210820091] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:22,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:22,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:22:22,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542858368] [2025-04-29 11:22:22,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:22,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:22,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:22,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:22,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:22,717 INFO L87 Difference]: Start difference. First operand 544 states and 680 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:22,731 INFO L93 Difference]: Finished difference Result 542 states and 673 transitions. [2025-04-29 11:22:22,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:22,731 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-04-29 11:22:22,731 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:22,732 INFO L225 Difference]: With dead ends: 542 [2025-04-29 11:22:22,732 INFO L226 Difference]: Without dead ends: 542 [2025-04-29 11:22:22,732 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:22,733 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 36 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:22,733 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 84 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-04-29 11:22:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-04-29 11:22:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 497 states have (on average 1.2696177062374245) internal successors, (631), 519 states have internal predecessors, (631), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-04-29 11:22:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 673 transitions. [2025-04-29 11:22:22,740 INFO L79 Accepts]: Start accepts. Automaton has 542 states and 673 transitions. Word has length 40 [2025-04-29 11:22:22,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:22,740 INFO L485 AbstractCegarLoop]: Abstraction has 542 states and 673 transitions. [2025-04-29 11:22:22,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:22,740 INFO L278 IsEmpty]: Start isEmpty. Operand 542 states and 673 transitions. [2025-04-29 11:22:22,741 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:22:22,741 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:22,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:22,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:22,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:22:22,941 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr20ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:22,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1408480592, now seen corresponding path program 1 times [2025-04-29 11:22:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:22,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373931906] [2025-04-29 11:22:22,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:22,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:22:22,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:22:22,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:22,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:23,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:23,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373931906] [2025-04-29 11:22:23,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373931906] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:23,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299252462] [2025-04-29 11:22:23,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:23,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:23,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:23,002 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:23,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:22:23,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:22:23,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:22:23,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:23,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:23,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:22:23,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:23,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:23,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299252462] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:23,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:23,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:22:23,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970424523] [2025-04-29 11:22:23,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:23,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:23,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:23,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:23,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:23,129 INFO L87 Difference]: Start difference. First operand 542 states and 673 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:23,155 INFO L93 Difference]: Finished difference Result 540 states and 666 transitions. [2025-04-29 11:22:23,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:23,155 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2025-04-29 11:22:23,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:23,156 INFO L225 Difference]: With dead ends: 540 [2025-04-29 11:22:23,156 INFO L226 Difference]: Without dead ends: 540 [2025-04-29 11:22:23,157 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:23,157 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:23,157 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 67 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-04-29 11:22:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 533. [2025-04-29 11:22:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 490 states have (on average 1.2571428571428571) internal successors, (616), 510 states have internal predecessors, (616), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-04-29 11:22:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 658 transitions. [2025-04-29 11:22:23,163 INFO L79 Accepts]: Start accepts. Automaton has 533 states and 658 transitions. Word has length 41 [2025-04-29 11:22:23,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:23,163 INFO L485 AbstractCegarLoop]: Abstraction has 533 states and 658 transitions. [2025-04-29 11:22:23,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:23,164 INFO L278 IsEmpty]: Start isEmpty. Operand 533 states and 658 transitions. [2025-04-29 11:22:23,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:22:23,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:23,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:23,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:22:23,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:23,365 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr21ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:23,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash -713225290, now seen corresponding path program 1 times [2025-04-29 11:22:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:23,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558699420] [2025-04-29 11:22:23,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:23,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:22:23,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:22:23,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:23,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:23,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:23,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558699420] [2025-04-29 11:22:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558699420] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:23,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485142070] [2025-04-29 11:22:23,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:23,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:23,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:23,434 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:23,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:22:23,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:22:23,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:22:23,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:23,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:23,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:22:23,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:23,493 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:22:23,517 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:22:23,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:22:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:23,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:23,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485142070] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:23,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:23,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:22:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953137106] [2025-04-29 11:22:23,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:23,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:23,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:23,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:23,563 INFO L87 Difference]: Start difference. First operand 533 states and 658 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:23,615 INFO L93 Difference]: Finished difference Result 551 states and 667 transitions. [2025-04-29 11:22:23,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:23,615 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-04-29 11:22:23,615 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:23,616 INFO L225 Difference]: With dead ends: 551 [2025-04-29 11:22:23,616 INFO L226 Difference]: Without dead ends: 551 [2025-04-29 11:22:23,617 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:23,617 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:23,617 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 120 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-04-29 11:22:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 533. [2025-04-29 11:22:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 490 states have (on average 1.2469387755102042) internal successors, (611), 510 states have internal predecessors, (611), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-04-29 11:22:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 653 transitions. [2025-04-29 11:22:23,624 INFO L79 Accepts]: Start accepts. Automaton has 533 states and 653 transitions. Word has length 42 [2025-04-29 11:22:23,624 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:23,625 INFO L485 AbstractCegarLoop]: Abstraction has 533 states and 653 transitions. [2025-04-29 11:22:23,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:23,625 INFO L278 IsEmpty]: Start isEmpty. Operand 533 states and 653 transitions. [2025-04-29 11:22:23,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:22:23,625 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:23,625 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:23,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:23,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-29 11:22:23,826 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:23,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:23,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1017374167, now seen corresponding path program 1 times [2025-04-29 11:22:23,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:23,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099025993] [2025-04-29 11:22:23,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:23,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:23,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:22:23,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:22:23,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:23,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:22:23,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:23,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099025993] [2025-04-29 11:22:23,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099025993] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:23,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463038869] [2025-04-29 11:22:23,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:23,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:23,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:23,862 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:23,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:22:23,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:22:23,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:22:23,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:23,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:22:23,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:22:23,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:23,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463038869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:23,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:22:23,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-04-29 11:22:23,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869963790] [2025-04-29 11:22:23,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:23,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:23,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:23,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:23,933 INFO L87 Difference]: Start difference. First operand 533 states and 653 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:23,946 INFO L93 Difference]: Finished difference Result 340 states and 396 transitions. [2025-04-29 11:22:23,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:23,946 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-04-29 11:22:23,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:23,947 INFO L225 Difference]: With dead ends: 340 [2025-04-29 11:22:23,947 INFO L226 Difference]: Without dead ends: 340 [2025-04-29 11:22:23,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:23,947 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:23,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 137 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-04-29 11:22:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 331. [2025-04-29 11:22:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 300 states have (on average 1.21) internal successors, (363), 314 states have internal predecessors, (363), 8 states have call successors, (8), 8 states have call predecessors, (8), 15 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2025-04-29 11:22:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 388 transitions. [2025-04-29 11:22:23,956 INFO L79 Accepts]: Start accepts. Automaton has 331 states and 388 transitions. Word has length 45 [2025-04-29 11:22:23,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:23,956 INFO L485 AbstractCegarLoop]: Abstraction has 331 states and 388 transitions. [2025-04-29 11:22:23,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:23,956 INFO L278 IsEmpty]: Start isEmpty. Operand 331 states and 388 transitions. [2025-04-29 11:22:23,957 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:22:23,957 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:23,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:23,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:24,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 11:22:24,157 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:24,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash -720557792, now seen corresponding path program 1 times [2025-04-29 11:22:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:24,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280467647] [2025-04-29 11:22:24,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:24,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:24,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:24,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:24,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:24,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:24,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280467647] [2025-04-29 11:22:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280467647] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:24,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825946316] [2025-04-29 11:22:24,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:24,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:24,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:24,293 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:24,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:22:24,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:24,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:24,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:24,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:24,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:22:24,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:24,444 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:24,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:22:24,531 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:24,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:22:24,557 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:24,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:22:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:24,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:24,628 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:22:24,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2025-04-29 11:22:24,755 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:22:24,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2025-04-29 11:22:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:24,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825946316] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:24,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:24,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2025-04-29 11:22:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775687532] [2025-04-29 11:22:24,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:24,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 11:22:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:24,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 11:22:24,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:22:24,881 INFO L87 Difference]: Start difference. First operand 331 states and 388 transitions. Second operand has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 11:22:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:25,019 INFO L93 Difference]: Finished difference Result 340 states and 396 transitions. [2025-04-29 11:22:25,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:25,020 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2025-04-29 11:22:25,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:25,021 INFO L225 Difference]: With dead ends: 340 [2025-04-29 11:22:25,021 INFO L226 Difference]: Without dead ends: 340 [2025-04-29 11:22:25,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:22:25,021 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 170 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:25,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 126 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-04-29 11:22:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 330. [2025-04-29 11:22:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 300 states have (on average 1.2033333333333334) internal successors, (361), 313 states have internal predecessors, (361), 8 states have call successors, (8), 8 states have call predecessors, (8), 15 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2025-04-29 11:22:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 386 transitions. [2025-04-29 11:22:25,025 INFO L79 Accepts]: Start accepts. Automaton has 330 states and 386 transitions. Word has length 51 [2025-04-29 11:22:25,025 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:25,025 INFO L485 AbstractCegarLoop]: Abstraction has 330 states and 386 transitions. [2025-04-29 11:22:25,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 11:22:25,025 INFO L278 IsEmpty]: Start isEmpty. Operand 330 states and 386 transitions. [2025-04-29 11:22:25,025 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:22:25,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:25,025 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:25,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:25,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-29 11:22:25,226 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:25,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash 818743275, now seen corresponding path program 1 times [2025-04-29 11:22:25,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:25,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069542420] [2025-04-29 11:22:25,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:25,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:25,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:25,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:25,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:25,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069542420] [2025-04-29 11:22:25,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069542420] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:25,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660962685] [2025-04-29 11:22:25,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:25,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:25,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:25,271 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:25,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-29 11:22:25,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:25,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:25,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:25,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:25,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:22:25,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:25,362 WARN L871 $PredicateComparison]: unable to prove that (exists ((|v_parse_input_c1_~x~0#1.base_77| Int)) (and (<= |v_parse_input_c1_~x~0#1.base_77| c_~global~0.base) (= |c_#valid| (store |c_old(#valid)| |v_parse_input_c1_~x~0#1.base_77| (select |c_#valid| |v_parse_input_c1_~x~0#1.base_77|))))) is different from true [2025-04-29 11:22:25,381 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:25,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:22:25,482 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:25,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:22:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-04-29 11:22:25,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660962685] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:25,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:25,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 16 [2025-04-29 11:22:25,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043240216] [2025-04-29 11:22:25,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:25,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:22:25,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:25,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:22:25,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=259, Unknown=2, NotChecked=32, Total=342 [2025-04-29 11:22:25,586 INFO L87 Difference]: Start difference. First operand 330 states and 386 transitions. Second operand has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:26,069 INFO L93 Difference]: Finished difference Result 324 states and 356 transitions. [2025-04-29 11:22:26,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-29 11:22:26,069 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2025-04-29 11:22:26,069 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:26,070 INFO L225 Difference]: With dead ends: 324 [2025-04-29 11:22:26,070 INFO L226 Difference]: Without dead ends: 324 [2025-04-29 11:22:26,070 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=356, Invalid=1367, Unknown=3, NotChecked=80, Total=1806 [2025-04-29 11:22:26,071 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 406 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:26,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 390 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 465 Invalid, 0 Unknown, 211 Unchecked, 0.2s Time] [2025-04-29 11:22:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-04-29 11:22:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 288. [2025-04-29 11:22:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 262 states have (on average 1.1793893129770991) internal successors, (309), 273 states have internal predecessors, (309), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-29 11:22:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 329 transitions. [2025-04-29 11:22:26,075 INFO L79 Accepts]: Start accepts. Automaton has 288 states and 329 transitions. Word has length 51 [2025-04-29 11:22:26,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:26,075 INFO L485 AbstractCegarLoop]: Abstraction has 288 states and 329 transitions. [2025-04-29 11:22:26,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:26,075 INFO L278 IsEmpty]: Start isEmpty. Operand 288 states and 329 transitions. [2025-04-29 11:22:26,076 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:22:26,076 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:26,076 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:26,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:26,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 11:22:26,277 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:26,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash -862455095, now seen corresponding path program 1 times [2025-04-29 11:22:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:26,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399369790] [2025-04-29 11:22:26,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:26,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:22:26,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:22:26,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:26,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:26,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:26,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399369790] [2025-04-29 11:22:26,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399369790] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:26,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717551304] [2025-04-29 11:22:26,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:26,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:26,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:26,675 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:26,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-29 11:22:26,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:22:26,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:22:26,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:26,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:26,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:22:26,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:26,865 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:26,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:22:26,997 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:26,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:22:27,034 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:27,035 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:22:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:27,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:27,184 INFO L325 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-04-29 11:22:27,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 165 [2025-04-29 11:22:27,358 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-29 11:22:27,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 185 [2025-04-29 11:22:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717551304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:27,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:27,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 14] total 45 [2025-04-29 11:22:27,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040002132] [2025-04-29 11:22:27,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:27,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-29 11:22:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:27,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-29 11:22:27,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1851, Unknown=0, NotChecked=0, Total=2070 [2025-04-29 11:22:27,566 INFO L87 Difference]: Start difference. First operand 288 states and 329 transitions. Second operand has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:22:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:27,914 INFO L93 Difference]: Finished difference Result 300 states and 338 transitions. [2025-04-29 11:22:27,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:22:27,914 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2025-04-29 11:22:27,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:27,915 INFO L225 Difference]: With dead ends: 300 [2025-04-29 11:22:27,915 INFO L226 Difference]: Without dead ends: 300 [2025-04-29 11:22:27,916 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=457, Invalid=2405, Unknown=0, NotChecked=0, Total=2862 [2025-04-29 11:22:27,916 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 403 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:27,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 321 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-04-29 11:22:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 288. [2025-04-29 11:22:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 262 states have (on average 1.1717557251908397) internal successors, (307), 273 states have internal predecessors, (307), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-29 11:22:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 327 transitions. [2025-04-29 11:22:27,920 INFO L79 Accepts]: Start accepts. Automaton has 288 states and 327 transitions. Word has length 52 [2025-04-29 11:22:27,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:27,920 INFO L485 AbstractCegarLoop]: Abstraction has 288 states and 327 transitions. [2025-04-29 11:22:27,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:22:27,921 INFO L278 IsEmpty]: Start isEmpty. Operand 288 states and 327 transitions. [2025-04-29 11:22:27,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:22:27,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:27,923 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:27,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:28,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:28,127 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:28,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash 494133805, now seen corresponding path program 1 times [2025-04-29 11:22:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:28,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113484457] [2025-04-29 11:22:28,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:28,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:22:28,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:22:28,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:28,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:22:28,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:28,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113484457] [2025-04-29 11:22:28,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113484457] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:28,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253590379] [2025-04-29 11:22:28,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:28,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:28,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:28,252 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:28,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-29 11:22:28,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:22:28,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:22:28,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:28,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:28,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:22:28,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:28,345 WARN L871 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (and (= (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| (select |c_#length| |parse_input_c1_~x~0#1.base|)) |c_#length|))) is different from true [2025-04-29 11:22:28,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:28,364 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-04-29 11:22:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2025-04-29 11:22:28,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:28,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253590379] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:28,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:28,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2025-04-29 11:22:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612770339] [2025-04-29 11:22:28,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:28,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:22:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:28,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:22:28,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=337, Unknown=1, NotChecked=38, Total=462 [2025-04-29 11:22:28,556 INFO L87 Difference]: Start difference. First operand 288 states and 327 transitions. Second operand has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:28,869 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2025-04-29 11:22:28,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:22:28,870 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2025-04-29 11:22:28,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:28,870 INFO L225 Difference]: With dead ends: 301 [2025-04-29 11:22:28,870 INFO L226 Difference]: Without dead ends: 301 [2025-04-29 11:22:28,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=380, Invalid=1029, Unknown=1, NotChecked=72, Total=1482 [2025-04-29 11:22:28,871 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 356 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:28,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 203 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 188 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2025-04-29 11:22:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-04-29 11:22:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 287. [2025-04-29 11:22:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 262 states have (on average 1.1412213740458015) internal successors, (299), 272 states have internal predecessors, (299), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-29 11:22:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 319 transitions. [2025-04-29 11:22:28,875 INFO L79 Accepts]: Start accepts. Automaton has 287 states and 319 transitions. Word has length 52 [2025-04-29 11:22:28,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:28,875 INFO L485 AbstractCegarLoop]: Abstraction has 287 states and 319 transitions. [2025-04-29 11:22:28,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:28,875 INFO L278 IsEmpty]: Start isEmpty. Operand 287 states and 319 transitions. [2025-04-29 11:22:28,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:22:28,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:28,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:28,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-29 11:22:29,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-29 11:22:29,076 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:29,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash 109343147, now seen corresponding path program 1 times [2025-04-29 11:22:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:29,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424966342] [2025-04-29 11:22:29,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:29,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:22:29,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:22:29,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:29,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:29,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:29,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424966342] [2025-04-29 11:22:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424966342] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:29,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996246964] [2025-04-29 11:22:29,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:29,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:29,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:29,285 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:29,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-29 11:22:29,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:22:29,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:22:29,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:29,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:29,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:22:29,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:29,407 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:29,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:22:29,572 INFO L325 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2025-04-29 11:22:29,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2025-04-29 11:22:29,624 INFO L325 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2025-04-29 11:22:29,624 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 64 [2025-04-29 11:22:29,638 INFO L325 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2025-04-29 11:22:29,638 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 1 [2025-04-29 11:22:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:29,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996246964] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:29,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:29,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-04-29 11:22:29,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338586446] [2025-04-29 11:22:29,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:29,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:22:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:29,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:22:29,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:22:29,723 INFO L87 Difference]: Start difference. First operand 287 states and 319 transitions. Second operand has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:22:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:30,072 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2025-04-29 11:22:30,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:22:30,073 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2025-04-29 11:22:30,073 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:30,074 INFO L225 Difference]: With dead ends: 297 [2025-04-29 11:22:30,074 INFO L226 Difference]: Without dead ends: 297 [2025-04-29 11:22:30,074 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=908, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 11:22:30,074 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 275 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:30,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 262 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-04-29 11:22:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 286. [2025-04-29 11:22:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 262 states have (on average 1.133587786259542) internal successors, (297), 271 states have internal predecessors, (297), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-29 11:22:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 317 transitions. [2025-04-29 11:22:30,079 INFO L79 Accepts]: Start accepts. Automaton has 286 states and 317 transitions. Word has length 54 [2025-04-29 11:22:30,081 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:30,081 INFO L485 AbstractCegarLoop]: Abstraction has 286 states and 317 transitions. [2025-04-29 11:22:30,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:22:30,081 INFO L278 IsEmpty]: Start isEmpty. Operand 286 states and 317 transitions. [2025-04-29 11:22:30,081 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-04-29 11:22:30,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:30,081 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:30,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-29 11:22:30,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:30,282 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:30,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:30,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1555763170, now seen corresponding path program 1 times [2025-04-29 11:22:30,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:30,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225584075] [2025-04-29 11:22:30,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:30,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:30,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:22:30,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:22:30,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:30,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:30,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:30,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225584075] [2025-04-29 11:22:30,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225584075] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:30,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673454198] [2025-04-29 11:22:30,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:30,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:30,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:30,661 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:30,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-29 11:22:30,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:22:30,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:22:30,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:30,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:30,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-29 11:22:30,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:30,936 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:30,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:22:31,307 INFO L325 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2025-04-29 11:22:31,308 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 67 [2025-04-29 11:22:31,347 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:22:31,357 INFO L325 Elim1Store]: treesize reduction 38, result has 20.8 percent of original size [2025-04-29 11:22:31,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 19 [2025-04-29 11:22:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:31,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673454198] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:31,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:31,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 30 [2025-04-29 11:22:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039445194] [2025-04-29 11:22:31,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:31,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-29 11:22:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:31,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-29 11:22:31,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 11:22:31,849 INFO L87 Difference]: Start difference. First operand 286 states and 317 transitions. Second operand has 32 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:33,756 INFO L93 Difference]: Finished difference Result 319 states and 345 transitions. [2025-04-29 11:22:33,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-29 11:22:33,757 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 60 [2025-04-29 11:22:33,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:33,758 INFO L225 Difference]: With dead ends: 319 [2025-04-29 11:22:33,758 INFO L226 Difference]: Without dead ends: 319 [2025-04-29 11:22:33,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=773, Invalid=4777, Unknown=0, NotChecked=0, Total=5550 [2025-04-29 11:22:33,759 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 517 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:33,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 816 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 11:22:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-29 11:22:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 292. [2025-04-29 11:22:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 270 states have (on average 1.125925925925926) internal successors, (304), 277 states have internal predecessors, (304), 7 states have call successors, (7), 7 states have call predecessors, (7), 11 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-04-29 11:22:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 322 transitions. [2025-04-29 11:22:33,762 INFO L79 Accepts]: Start accepts. Automaton has 292 states and 322 transitions. Word has length 60 [2025-04-29 11:22:33,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:33,762 INFO L485 AbstractCegarLoop]: Abstraction has 292 states and 322 transitions. [2025-04-29 11:22:33,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.793103448275862) internal successors, (110), 27 states have internal predecessors, (110), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:33,763 INFO L278 IsEmpty]: Start isEmpty. Operand 292 states and 322 transitions. [2025-04-29 11:22:33,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-04-29 11:22:33,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:33,763 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:33,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:33,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:33,968 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:33,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:33,968 INFO L85 PathProgramCache]: Analyzing trace with hash 984018055, now seen corresponding path program 1 times [2025-04-29 11:22:33,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:33,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092611462] [2025-04-29 11:22:33,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:33,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:33,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-29 11:22:33,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:22:33,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:33,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:34,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:34,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092611462] [2025-04-29 11:22:34,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092611462] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:34,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207622934] [2025-04-29 11:22:34,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:34,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:34,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:34,343 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:34,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-29 11:22:34,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-29 11:22:34,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:22:34,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:34,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:34,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:22:34,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:34,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:34,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-04-29 11:22:34,795 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:34,795 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:22:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:34,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:35,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207622934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:35,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:35,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 25 [2025-04-29 11:22:35,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391181602] [2025-04-29 11:22:35,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:35,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:22:35,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:35,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:22:35,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2025-04-29 11:22:35,078 INFO L87 Difference]: Start difference. First operand 292 states and 322 transitions. Second operand has 27 states, 24 states have (on average 4.666666666666667) internal successors, (112), 22 states have internal predecessors, (112), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:35,962 INFO L93 Difference]: Finished difference Result 335 states and 364 transitions. [2025-04-29 11:22:35,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:22:35,962 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 4.666666666666667) internal successors, (112), 22 states have internal predecessors, (112), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 61 [2025-04-29 11:22:35,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:35,963 INFO L225 Difference]: With dead ends: 335 [2025-04-29 11:22:35,963 INFO L226 Difference]: Without dead ends: 335 [2025-04-29 11:22:35,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=491, Invalid=2161, Unknown=0, NotChecked=0, Total=2652 [2025-04-29 11:22:35,964 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 547 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:35,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 313 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:22:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-04-29 11:22:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 244. [2025-04-29 11:22:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 226 states have (on average 1.1150442477876106) internal successors, (252), 231 states have internal predecessors, (252), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-29 11:22:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 267 transitions. [2025-04-29 11:22:35,967 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 267 transitions. Word has length 61 [2025-04-29 11:22:35,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:35,968 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 267 transitions. [2025-04-29 11:22:35,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 4.666666666666667) internal successors, (112), 22 states have internal predecessors, (112), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:22:35,968 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 267 transitions. [2025-04-29 11:22:35,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-29 11:22:35,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:35,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:35,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-29 11:22:36,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:36,169 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting parse_inputErr21ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:36,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1098768033, now seen corresponding path program 1 times [2025-04-29 11:22:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:36,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497687316] [2025-04-29 11:22:36,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:36,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:22:36,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:22:36,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:36,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:36,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:36,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497687316] [2025-04-29 11:22:36,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497687316] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:36,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569099744] [2025-04-29 11:22:36,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:36,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:36,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:36,311 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:36,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-29 11:22:36,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:22:36,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:22:36,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:36,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:36,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:22:36,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:36,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:22:36,459 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:36,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2025-04-29 11:22:36,474 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:22:36,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:22:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:36,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569099744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:36,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:36,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-04-29 11:22:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570226695] [2025-04-29 11:22:36,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:36,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:22:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:36,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:22:36,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:36,530 INFO L87 Difference]: Start difference. First operand 244 states and 267 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:22:36,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:36,641 INFO L93 Difference]: Finished difference Result 302 states and 331 transitions. [2025-04-29 11:22:36,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:22:36,641 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2025-04-29 11:22:36,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:36,642 INFO L225 Difference]: With dead ends: 302 [2025-04-29 11:22:36,642 INFO L226 Difference]: Without dead ends: 302 [2025-04-29 11:22:36,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:22:36,643 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:36,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 190 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:36,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-04-29 11:22:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 289. [2025-04-29 11:22:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 267 states have (on average 1.1161048689138577) internal successors, (298), 274 states have internal predecessors, (298), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-29 11:22:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 318 transitions. [2025-04-29 11:22:36,646 INFO L79 Accepts]: Start accepts. Automaton has 289 states and 318 transitions. Word has length 66 [2025-04-29 11:22:36,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:36,646 INFO L485 AbstractCegarLoop]: Abstraction has 289 states and 318 transitions. [2025-04-29 11:22:36,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:22:36,646 INFO L278 IsEmpty]: Start isEmpty. Operand 289 states and 318 transitions. [2025-04-29 11:22:36,646 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-29 11:22:36,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:36,647 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:36,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:36,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:36,847 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:36,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash -982356748, now seen corresponding path program 1 times [2025-04-29 11:22:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:36,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787535359] [2025-04-29 11:22:36,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:36,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:22:36,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:22:36,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:36,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:22:36,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:22:36,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:22:36,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:22:36,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:36,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:22:36,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:22:36,888 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:22:36,889 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 23 remaining) [2025-04-29 11:22:36,890 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2025-04-29 11:22:36,890 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2025-04-29 11:22:36,890 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2025-04-29 11:22:36,890 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2025-04-29 11:22:36,890 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2025-04-29 11:22:36,890 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2025-04-29 11:22:36,890 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2025-04-29 11:22:36,890 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2025-04-29 11:22:36,890 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (11 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (10 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (9 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (8 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (7 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr19ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr20ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2025-04-29 11:22:36,891 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr21ASSERT_VIOLATIONMEMORY_FREE (0 of 23 remaining) [2025-04-29 11:22:36,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-29 11:22:36,893 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:36,946 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:22:36,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:22:36 BoogieIcfgContainer [2025-04-29 11:22:36,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:22:36,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:22:36,956 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:22:36,957 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:22:36,957 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:07" (3/4) ... [2025-04-29 11:22:36,959 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 11:22:36,961 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:22:36,962 INFO L158 Benchmark]: Toolchain (without parser) took 29768.09ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 112.8MB in the beginning and 127.8MB in the end (delta: -14.9MB). Peak memory consumption was 165.6MB. Max. memory is 16.1GB. [2025-04-29 11:22:36,962 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:22:36,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.60ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:22:36,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.22ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:22:36,962 INFO L158 Benchmark]: Boogie Preprocessor took 38.42ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 93.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:22:36,962 INFO L158 Benchmark]: RCFGBuilder took 284.28ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 76.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:22:36,963 INFO L158 Benchmark]: TraceAbstraction took 29215.22ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 75.4MB in the beginning and 127.8MB in the end (delta: -52.5MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2025-04-29 11:22:36,963 INFO L158 Benchmark]: Witness Printer took 9.00ms. Allocated memory is still 327.2MB. Free memory was 127.8MB in the beginning and 127.8MB in the end (delta: 66.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:22:36,963 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.60ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.22ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.42ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 93.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 284.28ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 76.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29215.22ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 75.4MB in the beginning and 127.8MB in the end (delta: -52.5MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Witness Printer took 9.00ms. Allocated memory is still 327.2MB. Free memory was 127.8MB in the beginning and 127.8MB in the end (delta: 66.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 71]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 37, overapproximation of memtrack at line 71. Possible FailurePath: [L27] int state = STATE_1; [L28] char *global = 0; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L72] CALL parse_input("c1") VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0] [L36] int i = 0; VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L36] COND TRUE i < 2 VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0] [L37] EXPR commands[i].name VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L37] COND TRUE strcmp(commands[i].name,input) == 0 [L38] EXPR commands[i].state_needed VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L38] COND TRUE state >= commands[i].state_needed [L39] EXPR commands[i].function VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, input={3:0}, state=0] [L39] CALL commands[i].function() [L47] char *x = (char *)malloc(sizeof(char)); [L48] COND FALSE !(!x) VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L53] COND FALSE !(\read(*global)) VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L56] global = x [L57] state = STATE_2 VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={7:0}, state=1] [L39] RET commands[i].function() [L72] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L73] CALL parse_input("c1") VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L36] int i = 0; VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L36] COND TRUE i < 2 VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L37] EXPR commands[i].name VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L37] COND FALSE !(strcmp(commands[i].name,input) == 0) [L36] i++ VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L36] COND TRUE i < 2 VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L37] EXPR commands[i].name VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L37] COND FALSE !(strcmp(commands[i].name,input) == 0) [L36] i++ VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=2, input={4:0}, state=1] [L36] COND FALSE !(i < 2) [L73] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L74] CALL parse_input("c2") VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L36] int i = 0; VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L36] COND TRUE i < 2 VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L37] EXPR commands[i].name VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L37] COND FALSE !(strcmp(commands[i].name,input) == 0) [L36] i++ VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L36] COND TRUE i < 2 VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L37] EXPR commands[i].name VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L37] COND FALSE !(strcmp(commands[i].name,input) == 0) [L36] i++ VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=2, input={5:0}, state=1] [L36] COND FALSE !(i < 2) [L74] RET parse_input("c2") VAL [commands={6:0}, global={7:0}, state=1] [L75] return 0; VAL [\result=0, commands={6:0}, global={7:0}, state=1] - 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: 37]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 37]: 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: 63]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 78 edges, 23 error locations. Started 1 CEGAR loops. OverallTime: 29.1s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7191 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7191 mSDsluCounter, 8602 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 636 IncrementalHoareTripleChecker+Unchecked, 6843 mSDsCounter, 949 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8895 IncrementalHoareTripleChecker+Invalid, 10480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 949 mSolverCounterUnsat, 1759 mSDtfsCounter, 8895 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1903 GetRequests, 1229 SyntacticMatches, 9 SemanticMatches, 665 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5843 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=23, InterpolantAutomatonStates: 398, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 1113 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 2099 NumberOfCodeBlocks, 2099 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2307 ConstructedInterpolants, 154 QuantifiedInterpolants, 27622 SizeOfPredicates, 92 NumberOfNonLiveVariables, 6035 ConjunctsInSsa, 450 ConjunctsInUnsatCore, 69 InterpolantComputations, 14 PerfectInterpolantSequences, 411/1071 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-29 11:22:36,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/memsafety-bftpd/bftpd_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 0559bc0079d827bb14d884d97cbfcf7bd195105509cc81ed196e15551b246678 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:22:38,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:22:38,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-29 11:22:38,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:22:38,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:22:38,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:22:38,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:22:38,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:22:38,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:22:38,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:22:38,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:22:38,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:22:38,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:22:38,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:22:38,785 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:22:38,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:22:38,785 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:22:38,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:22:38,786 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:22:38,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:38,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:38,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:22:38,787 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 0559bc0079d827bb14d884d97cbfcf7bd195105509cc81ed196e15551b246678 [2025-04-29 11:22:39,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:22:39,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:22:39,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:22:39,034 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:22:39,035 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:22:39,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_1.c [2025-04-29 11:22:40,297 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e17ab7d7/522edf5653ff46b3b5dc44bd65bc7c18/FLAG51ee38994 [2025-04-29 11:22:40,468 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:22:40,469 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-bftpd/bftpd_1.c [2025-04-29 11:22:40,470 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:40,470 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:40,474 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e17ab7d7/522edf5653ff46b3b5dc44bd65bc7c18/FLAG51ee38994 [2025-04-29 11:22:41,347 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e17ab7d7/522edf5653ff46b3b5dc44bd65bc7c18 [2025-04-29 11:22:41,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:22:41,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:22:41,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:41,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:22:41,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:22:41,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8757d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41, skipping insertion in model container [2025-04-29 11:22:41,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:22:41,490 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:22:41,495 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:41,506 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:22:41,532 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:41,543 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:22:41,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41 WrapperNode [2025-04-29 11:22:41,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:41,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:41,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:22:41,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:22:41,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,574 INFO L138 Inliner]: procedures = 16, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2025-04-29 11:22:41,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:41,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:22:41,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:22:41,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:22:41,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,606 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2025-04-29 11:22:41,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,620 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:22:41,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:22:41,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:22:41,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:22:41,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (1/1) ... [2025-04-29 11:22:41,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:41,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:41,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:22:41,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:22:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:22:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:22:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:22:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:22:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:22:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:22:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:22:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-04-29 11:22:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-04-29 11:22:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-04-29 11:22:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-04-29 11:22:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-04-29 11:22:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-04-29 11:22:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-04-29 11:22:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-04-29 11:22:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:22:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:22:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:22:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:22:41,788 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:22:41,789 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:22:42,001 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-04-29 11:22:42,002 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:22:42,009 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:22:42,010 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:22:42,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:42 BoogieIcfgContainer [2025-04-29 11:22:42,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:22:42,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:22:42,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:22:42,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:22:42,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:22:41" (1/3) ... [2025-04-29 11:22:42,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73154e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:42, skipping insertion in model container [2025-04-29 11:22:42,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:41" (2/3) ... [2025-04-29 11:22:42,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73154e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:42, skipping insertion in model container [2025-04-29 11:22:42,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:42" (3/3) ... [2025-04-29 11:22:42,031 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_1.c [2025-04-29 11:22:42,040 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:22:42,042 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_1.c that has 2 procedures, 67 locations, 78 edges, 1 initial locations, 1 loop locations, and 23 error locations. [2025-04-29 11:22:42,072 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:22:42,079 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a4c7485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:22:42,080 INFO L341 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-04-29 11:22:42,082 INFO L278 IsEmpty]: Start isEmpty. Operand has 67 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:22:42,085 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:42,085 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:42,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:42,086 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:42,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash -742867072, now seen corresponding path program 1 times [2025-04-29 11:22:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:42,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053314569] [2025-04-29 11:22:42,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:42,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:42,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:42,099 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) [2025-04-29 11:22:42,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:22:42,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:42,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:42,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:42,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:42,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:22:42,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:42,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:42,269 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:42,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053314569] [2025-04-29 11:22:42,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053314569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:42,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:42,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:22:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937847204] [2025-04-29 11:22:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:42,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:42,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:42,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:42,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:42,293 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:42,429 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2025-04-29 11:22:42,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:42,433 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:22:42,433 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:42,439 INFO L225 Difference]: With dead ends: 121 [2025-04-29 11:22:42,439 INFO L226 Difference]: Without dead ends: 117 [2025-04-29 11:22:42,440 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:42,443 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 56 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:42,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 109 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-29 11:22:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2025-04-29 11:22:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.7241379310344827) internal successors, (100), 80 states have internal predecessors, (100), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-29 11:22:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2025-04-29 11:22:42,480 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 6 [2025-04-29 11:22:42,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:42,480 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2025-04-29 11:22:42,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:42,480 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2025-04-29 11:22:42,480 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:42,480 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:42,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:42,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:22:42,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:42,681 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:42,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:42,682 INFO L85 PathProgramCache]: Analyzing trace with hash -742867071, now seen corresponding path program 1 times [2025-04-29 11:22:42,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:42,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640642881] [2025-04-29 11:22:42,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:42,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:42,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:42,684 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) [2025-04-29 11:22:42,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:22:42,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:42,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:42,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:42,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:42,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:22:42,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:42,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:42,836 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:42,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640642881] [2025-04-29 11:22:42,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640642881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:42,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:42,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171832763] [2025-04-29 11:22:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:42,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:42,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:42,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:42,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:42,837 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:42,952 INFO L93 Difference]: Finished difference Result 187 states and 247 transitions. [2025-04-29 11:22:42,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:42,952 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:22:42,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:42,953 INFO L225 Difference]: With dead ends: 187 [2025-04-29 11:22:42,953 INFO L226 Difference]: Without dead ends: 187 [2025-04-29 11:22:42,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:42,954 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 92 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:42,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 154 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-04-29 11:22:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 156. [2025-04-29 11:22:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 120 states have (on average 1.7666666666666666) internal successors, (212), 142 states have internal predecessors, (212), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 243 transitions. [2025-04-29 11:22:42,971 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 243 transitions. Word has length 6 [2025-04-29 11:22:42,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:42,971 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 243 transitions. [2025-04-29 11:22:42,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:42,971 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 243 transitions. [2025-04-29 11:22:42,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:22:42,971 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:42,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:42,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:22:43,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:43,173 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:43,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1554042775, now seen corresponding path program 1 times [2025-04-29 11:22:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:43,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206283211] [2025-04-29 11:22:43,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:43,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:43,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:43,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:43,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:22:43,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:22:43,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:22:43,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:43,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:43,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:22:43,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:43,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:43,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:43,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206283211] [2025-04-29 11:22:43,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206283211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:43,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:43,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:43,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466810615] [2025-04-29 11:22:43,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:43,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:43,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:43,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:43,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:43,337 INFO L87 Difference]: Start difference. First operand 156 states and 243 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:43,523 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2025-04-29 11:22:43,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:43,524 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:22:43,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:43,525 INFO L225 Difference]: With dead ends: 207 [2025-04-29 11:22:43,527 INFO L226 Difference]: Without dead ends: 207 [2025-04-29 11:22:43,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:43,527 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:43,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 183 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-04-29 11:22:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 159. [2025-04-29 11:22:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 123 states have (on average 1.7479674796747968) internal successors, (215), 145 states have internal predecessors, (215), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 246 transitions. [2025-04-29 11:22:43,546 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 246 transitions. Word has length 7 [2025-04-29 11:22:43,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:43,546 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 246 transitions. [2025-04-29 11:22:43,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:43,546 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 246 transitions. [2025-04-29 11:22:43,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:22:43,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:43,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:43,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:22:43,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:43,747 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:43,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash -930685728, now seen corresponding path program 1 times [2025-04-29 11:22:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:43,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651583966] [2025-04-29 11:22:43,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:43,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:43,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:43,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:43,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:22:43,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:22:43,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:22:43,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:43,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:43,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:22:43,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:43,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:43,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:43,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651583966] [2025-04-29 11:22:43,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651583966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:43,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:43,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:43,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045570644] [2025-04-29 11:22:43,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:43,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:43,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:43,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:43,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:43,900 INFO L87 Difference]: Start difference. First operand 159 states and 246 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:44,044 INFO L93 Difference]: Finished difference Result 189 states and 248 transitions. [2025-04-29 11:22:44,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:44,045 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-29 11:22:44,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:44,046 INFO L225 Difference]: With dead ends: 189 [2025-04-29 11:22:44,046 INFO L226 Difference]: Without dead ends: 189 [2025-04-29 11:22:44,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:44,047 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 89 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:44,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 205 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-04-29 11:22:44,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 159. [2025-04-29 11:22:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 145 states have internal predecessors, (213), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 244 transitions. [2025-04-29 11:22:44,065 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 244 transitions. Word has length 8 [2025-04-29 11:22:44,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:44,065 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 244 transitions. [2025-04-29 11:22:44,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:44,065 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2025-04-29 11:22:44,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:22:44,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:44,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:44,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:22:44,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:44,270 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:44,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:44,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1213513547, now seen corresponding path program 1 times [2025-04-29 11:22:44,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:44,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [76156044] [2025-04-29 11:22:44,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:44,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:44,273 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:44,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:22:44,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:22:44,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:22:44,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:44,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:44,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:22:44,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:44,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:44,356 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:44,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76156044] [2025-04-29 11:22:44,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76156044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:44,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:44,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:44,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801496247] [2025-04-29 11:22:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:44,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:44,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:44,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:44,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:44,356 INFO L87 Difference]: Start difference. First operand 159 states and 244 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:44,475 INFO L93 Difference]: Finished difference Result 253 states and 346 transitions. [2025-04-29 11:22:44,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:44,475 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:22:44,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:44,476 INFO L225 Difference]: With dead ends: 253 [2025-04-29 11:22:44,476 INFO L226 Difference]: Without dead ends: 253 [2025-04-29 11:22:44,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:44,477 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 188 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:44,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 184 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-29 11:22:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 192. [2025-04-29 11:22:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 154 states have (on average 1.6818181818181819) internal successors, (259), 177 states have internal predecessors, (259), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 290 transitions. [2025-04-29 11:22:44,486 INFO L79 Accepts]: Start accepts. Automaton has 192 states and 290 transitions. Word has length 9 [2025-04-29 11:22:44,486 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:44,486 INFO L485 AbstractCegarLoop]: Abstraction has 192 states and 290 transitions. [2025-04-29 11:22:44,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:44,487 INFO L278 IsEmpty]: Start isEmpty. Operand 192 states and 290 transitions. [2025-04-29 11:22:44,487 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:22:44,487 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:44,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:44,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:44,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:44,691 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:44,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:44,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1035785662, now seen corresponding path program 1 times [2025-04-29 11:22:44,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:44,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685864475] [2025-04-29 11:22:44,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:44,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:44,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:44,694 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:44,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:22:44,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:22:44,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:22:44,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:44,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:44,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:22:44,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:44,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:44,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:44,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685864475] [2025-04-29 11:22:44,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685864475] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:44,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:44,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081082243] [2025-04-29 11:22:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:44,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:44,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:44,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:44,815 INFO L87 Difference]: Start difference. First operand 192 states and 290 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:44,929 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2025-04-29 11:22:44,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:44,929 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:22:44,929 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:44,930 INFO L225 Difference]: With dead ends: 242 [2025-04-29 11:22:44,930 INFO L226 Difference]: Without dead ends: 242 [2025-04-29 11:22:44,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:44,931 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 179 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:44,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 206 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-04-29 11:22:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 206. [2025-04-29 11:22:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 167 states have (on average 1.6766467065868262) internal successors, (280), 191 states have internal predecessors, (280), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions. [2025-04-29 11:22:44,941 INFO L79 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 10 [2025-04-29 11:22:44,941 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:44,941 INFO L485 AbstractCegarLoop]: Abstraction has 206 states and 311 transitions. [2025-04-29 11:22:44,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:44,941 INFO L278 IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions. [2025-04-29 11:22:44,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:22:44,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:44,941 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:44,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:22:45,142 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:45,142 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:45,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1014350664, now seen corresponding path program 1 times [2025-04-29 11:22:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:45,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460106787] [2025-04-29 11:22:45,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:45,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:45,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:45,145 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:45,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:22:45,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:45,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:45,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:45,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:45,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:22:45,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:45,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:45,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:45,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460106787] [2025-04-29 11:22:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460106787] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:45,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:45,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-04-29 11:22:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253958530] [2025-04-29 11:22:45,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:45,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:22:45,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:45,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:22:45,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:45,488 INFO L87 Difference]: Start difference. First operand 206 states and 311 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:45,743 INFO L93 Difference]: Finished difference Result 277 states and 368 transitions. [2025-04-29 11:22:45,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:45,744 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:22:45,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:45,750 INFO L225 Difference]: With dead ends: 277 [2025-04-29 11:22:45,751 INFO L226 Difference]: Without dead ends: 277 [2025-04-29 11:22:45,751 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:45,751 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 121 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:45,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 383 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-04-29 11:22:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 236. [2025-04-29 11:22:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 197 states have (on average 1.6649746192893402) internal successors, (328), 221 states have internal predecessors, (328), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 359 transitions. [2025-04-29 11:22:45,762 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 359 transitions. Word has length 14 [2025-04-29 11:22:45,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:45,762 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 359 transitions. [2025-04-29 11:22:45,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:45,762 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 359 transitions. [2025-04-29 11:22:45,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:22:45,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:45,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:45,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:22:45,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:45,963 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:45,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1380099458, now seen corresponding path program 1 times [2025-04-29 11:22:45,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:45,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165056453] [2025-04-29 11:22:45,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:45,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:45,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:45,966 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:45,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:22:45,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:22:46,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:22:46,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:46,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:46,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:22:46,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:46,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:46,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:46,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165056453] [2025-04-29 11:22:46,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165056453] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:46,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:46,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-04-29 11:22:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870662882] [2025-04-29 11:22:46,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:46,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:22:46,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:46,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:22:46,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:46,517 INFO L87 Difference]: Start difference. First operand 236 states and 359 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:47,636 INFO L93 Difference]: Finished difference Result 372 states and 510 transitions. [2025-04-29 11:22:47,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:22:47,636 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-29 11:22:47,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:47,637 INFO L225 Difference]: With dead ends: 372 [2025-04-29 11:22:47,637 INFO L226 Difference]: Without dead ends: 372 [2025-04-29 11:22:47,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:22:47,638 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 336 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:47,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 361 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:22:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-04-29 11:22:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 274. [2025-04-29 11:22:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 235 states have (on average 1.6595744680851063) internal successors, (390), 259 states have internal predecessors, (390), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-29 11:22:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 421 transitions. [2025-04-29 11:22:47,645 INFO L79 Accepts]: Start accepts. Automaton has 274 states and 421 transitions. Word has length 15 [2025-04-29 11:22:47,645 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:47,645 INFO L485 AbstractCegarLoop]: Abstraction has 274 states and 421 transitions. [2025-04-29 11:22:47,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:47,645 INFO L278 IsEmpty]: Start isEmpty. Operand 274 states and 421 transitions. [2025-04-29 11:22:47,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:22:47,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:47,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:47,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:47,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:47,850 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:47,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash -166589721, now seen corresponding path program 1 times [2025-04-29 11:22:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:47,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606961584] [2025-04-29 11:22:47,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:47,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:47,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:47,853 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:47,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:22:47,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:47,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:47,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:47,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:47,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:22:47,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:48,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:48,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:48,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606961584] [2025-04-29 11:22:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606961584] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:48,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-04-29 11:22:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680819869] [2025-04-29 11:22:48,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:48,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:22:48,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:48,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:22:48,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:48,476 INFO L87 Difference]: Start difference. First operand 274 states and 421 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:49,574 INFO L93 Difference]: Finished difference Result 504 states and 693 transitions. [2025-04-29 11:22:49,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:22:49,574 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:22:49,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:49,576 INFO L225 Difference]: With dead ends: 504 [2025-04-29 11:22:49,576 INFO L226 Difference]: Without dead ends: 504 [2025-04-29 11:22:49,576 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:22:49,577 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 316 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:49,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 482 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:22:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-04-29 11:22:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 377. [2025-04-29 11:22:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 334 states have (on average 1.688622754491018) internal successors, (564), 358 states have internal predecessors, (564), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-04-29 11:22:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 606 transitions. [2025-04-29 11:22:49,591 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 606 transitions. Word has length 16 [2025-04-29 11:22:49,591 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:49,591 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 606 transitions. [2025-04-29 11:22:49,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,591 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 606 transitions. [2025-04-29 11:22:49,591 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:49,591 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:49,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:49,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:49,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:49,792 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:49,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1018139209, now seen corresponding path program 1 times [2025-04-29 11:22:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:49,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507698955] [2025-04-29 11:22:49,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:49,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:49,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:49,795 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:49,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:22:49,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:49,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:49,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:49,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:49,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:22:49,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:49,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:49,869 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:49,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507698955] [2025-04-29 11:22:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507698955] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:22:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538312126] [2025-04-29 11:22:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:49,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:49,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:49,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:49,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:49,870 INFO L87 Difference]: Start difference. First operand 377 states and 606 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:49,891 INFO L93 Difference]: Finished difference Result 517 states and 829 transitions. [2025-04-29 11:22:49,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:49,891 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:22:49,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:49,893 INFO L225 Difference]: With dead ends: 517 [2025-04-29 11:22:49,893 INFO L226 Difference]: Without dead ends: 517 [2025-04-29 11:22:49,894 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:49,894 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:49,894 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-04-29 11:22:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 501. [2025-04-29 11:22:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 449 states have (on average 1.6815144766146994) internal successors, (755), 475 states have internal predecessors, (755), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2025-04-29 11:22:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 827 transitions. [2025-04-29 11:22:49,906 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 827 transitions. Word has length 18 [2025-04-29 11:22:49,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:49,906 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 827 transitions. [2025-04-29 11:22:49,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,907 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 827 transitions. [2025-04-29 11:22:49,907 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:49,907 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:49,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:49,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:50,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:50,108 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:50,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:50,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1018139465, now seen corresponding path program 1 times [2025-04-29 11:22:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:50,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171121104] [2025-04-29 11:22:50,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:50,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:50,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:50,110 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:50,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:22:50,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:50,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:50,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:50,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:50,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:22:50,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:50,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:50,161 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:50,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171121104] [2025-04-29 11:22:50,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171121104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:50,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:50,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:50,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658416994] [2025-04-29 11:22:50,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:50,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:50,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:50,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:50,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:50,162 INFO L87 Difference]: Start difference. First operand 501 states and 827 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:50,174 INFO L93 Difference]: Finished difference Result 500 states and 821 transitions. [2025-04-29 11:22:50,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:50,174 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:22:50,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:50,176 INFO L225 Difference]: With dead ends: 500 [2025-04-29 11:22:50,176 INFO L226 Difference]: Without dead ends: 500 [2025-04-29 11:22:50,176 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:50,177 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:50,177 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-04-29 11:22:50,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-04-29 11:22:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 449 states have (on average 1.6681514476614698) internal successors, (749), 474 states have internal predecessors, (749), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2025-04-29 11:22:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 821 transitions. [2025-04-29 11:22:50,193 INFO L79 Accepts]: Start accepts. Automaton has 500 states and 821 transitions. Word has length 18 [2025-04-29 11:22:50,193 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:50,193 INFO L485 AbstractCegarLoop]: Abstraction has 500 states and 821 transitions. [2025-04-29 11:22:50,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,193 INFO L278 IsEmpty]: Start isEmpty. Operand 500 states and 821 transitions. [2025-04-29 11:22:50,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:22:50,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:50,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:50,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 11:22:50,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:50,397 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:50,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1497544475, now seen corresponding path program 1 times [2025-04-29 11:22:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:50,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101839326] [2025-04-29 11:22:50,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:50,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:50,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:50,400 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:50,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:22:50,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:22:50,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:22:50,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:50,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:50,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:22:50,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:50,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:50,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:50,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101839326] [2025-04-29 11:22:50,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101839326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:50,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:50,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:22:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48895223] [2025-04-29 11:22:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:50,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:50,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:50,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:50,490 INFO L87 Difference]: Start difference. First operand 500 states and 821 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:50,532 INFO L93 Difference]: Finished difference Result 574 states and 907 transitions. [2025-04-29 11:22:50,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:50,532 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:22:50,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:50,534 INFO L225 Difference]: With dead ends: 574 [2025-04-29 11:22:50,534 INFO L226 Difference]: Without dead ends: 574 [2025-04-29 11:22:50,534 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:50,535 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 44 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:50,535 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 107 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-04-29 11:22:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 557. [2025-04-29 11:22:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 503 states have (on average 1.6441351888667992) internal successors, (827), 529 states have internal predecessors, (827), 16 states have call successors, (16), 11 states have call predecessors, (16), 16 states have return successors, (60), 16 states have call predecessors, (60), 16 states have call successors, (60) [2025-04-29 11:22:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 903 transitions. [2025-04-29 11:22:50,546 INFO L79 Accepts]: Start accepts. Automaton has 557 states and 903 transitions. Word has length 19 [2025-04-29 11:22:50,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:50,546 INFO L485 AbstractCegarLoop]: Abstraction has 557 states and 903 transitions. [2025-04-29 11:22:50,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,546 INFO L278 IsEmpty]: Start isEmpty. Operand 557 states and 903 transitions. [2025-04-29 11:22:50,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:22:50,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:50,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:50,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:50,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:50,751 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:50,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:50,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1497552419, now seen corresponding path program 1 times [2025-04-29 11:22:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:50,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628980615] [2025-04-29 11:22:50,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:50,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:50,753 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:50,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:22:50,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:22:50,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:22:50,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:50,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:50,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:22:50,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:50,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:50,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:50,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628980615] [2025-04-29 11:22:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628980615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:50,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:50,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866216369] [2025-04-29 11:22:50,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:50,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:50,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:50,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:50,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:50,806 INFO L87 Difference]: Start difference. First operand 557 states and 903 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:50,810 INFO L93 Difference]: Finished difference Result 512 states and 836 transitions. [2025-04-29 11:22:50,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:50,812 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:22:50,812 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:50,813 INFO L225 Difference]: With dead ends: 512 [2025-04-29 11:22:50,813 INFO L226 Difference]: Without dead ends: 512 [2025-04-29 11:22:50,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:50,814 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:50,815 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-04-29 11:22:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-04-29 11:22:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 463 states have (on average 1.6414686825053997) internal successors, (760), 484 states have internal predecessors, (760), 16 states have call successors, (16), 11 states have call predecessors, (16), 16 states have return successors, (60), 16 states have call predecessors, (60), 16 states have call successors, (60) [2025-04-29 11:22:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 836 transitions. [2025-04-29 11:22:50,825 INFO L79 Accepts]: Start accepts. Automaton has 512 states and 836 transitions. Word has length 19 [2025-04-29 11:22:50,825 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:50,825 INFO L485 AbstractCegarLoop]: Abstraction has 512 states and 836 transitions. [2025-04-29 11:22:50,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,825 INFO L278 IsEmpty]: Start isEmpty. Operand 512 states and 836 transitions. [2025-04-29 11:22:50,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:22:50,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:50,826 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:22:50,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-29 11:22:51,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:51,027 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:51,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1498279921, now seen corresponding path program 2 times [2025-04-29 11:22:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:51,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806645394] [2025-04-29 11:22:51,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:22:51,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:51,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:51,030 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:51,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:22:51,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-29 11:22:51,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:22:51,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:22:51,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:51,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:22:51,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,153 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:51,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806645394] [2025-04-29 11:22:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806645394] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:51,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-04-29 11:22:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807164897] [2025-04-29 11:22:51,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:51,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:22:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:51,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:22:51,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:51,154 INFO L87 Difference]: Start difference. First operand 512 states and 836 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:51,219 INFO L93 Difference]: Finished difference Result 450 states and 689 transitions. [2025-04-29 11:22:51,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:51,220 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-29 11:22:51,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:51,221 INFO L225 Difference]: With dead ends: 450 [2025-04-29 11:22:51,221 INFO L226 Difference]: Without dead ends: 450 [2025-04-29 11:22:51,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:51,222 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 22 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:51,222 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 316 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-04-29 11:22:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 432. [2025-04-29 11:22:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 383 states have (on average 1.5378590078328982) internal successors, (589), 404 states have internal predecessors, (589), 16 states have call successors, (16), 11 states have call predecessors, (16), 16 states have return successors, (60), 16 states have call predecessors, (60), 16 states have call successors, (60) [2025-04-29 11:22:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 665 transitions. [2025-04-29 11:22:51,230 INFO L79 Accepts]: Start accepts. Automaton has 432 states and 665 transitions. Word has length 22 [2025-04-29 11:22:51,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:51,230 INFO L485 AbstractCegarLoop]: Abstraction has 432 states and 665 transitions. [2025-04-29 11:22:51,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:51,230 INFO L278 IsEmpty]: Start isEmpty. Operand 432 states and 665 transitions. [2025-04-29 11:22:51,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:22:51,230 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:51,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:51,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:22:51,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:51,431 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:51,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash 797664614, now seen corresponding path program 1 times [2025-04-29 11:22:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:51,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108602146] [2025-04-29 11:22:51,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:51,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:51,433 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:51,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:22:51,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:22:51,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:22:51,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:51,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:51,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:22:51,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:51,483 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:51,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108602146] [2025-04-29 11:22:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108602146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:51,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970722891] [2025-04-29 11:22:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:51,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:51,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:51,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:51,484 INFO L87 Difference]: Start difference. First operand 432 states and 665 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:51,489 INFO L93 Difference]: Finished difference Result 315 states and 467 transitions. [2025-04-29 11:22:51,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:51,489 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-04-29 11:22:51,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:51,490 INFO L225 Difference]: With dead ends: 315 [2025-04-29 11:22:51,490 INFO L226 Difference]: Without dead ends: 315 [2025-04-29 11:22:51,490 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:51,490 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:51,490 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 104 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-04-29 11:22:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-04-29 11:22:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 275 states have (on average 1.52) internal successors, (418), 294 states have internal predecessors, (418), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (37), 12 states have call predecessors, (37), 12 states have call successors, (37) [2025-04-29 11:22:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2025-04-29 11:22:51,496 INFO L79 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 25 [2025-04-29 11:22:51,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:51,497 INFO L485 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2025-04-29 11:22:51,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:22:51,497 INFO L278 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2025-04-29 11:22:51,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:22:51,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:51,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:51,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:51,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:51,698 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:22:51,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 233552810, now seen corresponding path program 1 times [2025-04-29 11:22:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:22:51,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078959295] [2025-04-29 11:22:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:51,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:51,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:51,701 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:22:51,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:22:51,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:22:51,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:22:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:51,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:22:51,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:51,890 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-29 11:22:51,891 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-04-29 11:22:52,006 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-04-29 11:22:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:52,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:52,157 INFO L325 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-04-29 11:22:52,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2025-04-29 11:22:56,616 INFO L325 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-04-29 11:22:56,616 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2025-04-29 11:22:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:56,720 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:22:56,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078959295] [2025-04-29 11:22:56,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078959295] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:56,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:56,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2025-04-29 11:22:56,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964184805] [2025-04-29 11:22:56,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:56,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:22:56,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:22:56,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:22:56,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=3, NotChecked=0, Total=110 [2025-04-29 11:22:56,722 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:00,760 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:23:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:03,673 INFO L93 Difference]: Finished difference Result 352 states and 486 transitions. [2025-04-29 11:23:03,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:23:03,674 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-04-29 11:23:03,674 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:03,675 INFO L225 Difference]: With dead ends: 352 [2025-04-29 11:23:03,675 INFO L226 Difference]: Without dead ends: 352 [2025-04-29 11:23:03,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=119, Invalid=217, Unknown=6, NotChecked=0, Total=342 [2025-04-29 11:23:03,676 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 168 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 35 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:03,676 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 93 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 106 Invalid, 16 Unknown, 0 Unchecked, 5.7s Time] [2025-04-29 11:23:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-04-29 11:23:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 339. [2025-04-29 11:23:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 294 states have (on average 1.380952380952381) internal successors, (406), 318 states have internal predecessors, (406), 12 states have call successors, (12), 8 states have call predecessors, (12), 19 states have return successors, (48), 12 states have call predecessors, (48), 12 states have call successors, (48) [2025-04-29 11:23:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 466 transitions. [2025-04-29 11:23:03,683 INFO L79 Accepts]: Start accepts. Automaton has 339 states and 466 transitions. Word has length 27 [2025-04-29 11:23:03,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:03,683 INFO L485 AbstractCegarLoop]: Abstraction has 339 states and 466 transitions. [2025-04-29 11:23:03,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:03,683 INFO L278 IsEmpty]: Start isEmpty. Operand 339 states and 466 transitions. [2025-04-29 11:23:03,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:03,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:03,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:03,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-29 11:23:03,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:03,888 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:23:03,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1734013005, now seen corresponding path program 1 times [2025-04-29 11:23:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:03,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25690651] [2025-04-29 11:23:03,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:03,890 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:03,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:23:03,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:23:03,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:03,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:03,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:03,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:23:03,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:05,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:05,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:05,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25690651] [2025-04-29 11:23:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25690651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:05,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:05,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:23:05,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960553893] [2025-04-29 11:23:05,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:05,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:23:05,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:05,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:23:05,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:05,666 INFO L87 Difference]: Start difference. First operand 339 states and 466 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:06,785 INFO L93 Difference]: Finished difference Result 358 states and 477 transitions. [2025-04-29 11:23:06,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:23:06,785 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-04-29 11:23:06,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:06,787 INFO L225 Difference]: With dead ends: 358 [2025-04-29 11:23:06,787 INFO L226 Difference]: Without dead ends: 358 [2025-04-29 11:23:06,787 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:23:06,787 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 90 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:06,787 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 214 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 11:23:06,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-04-29 11:23:06,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 348. [2025-04-29 11:23:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 303 states have (on average 1.3696369636963697) internal successors, (415), 327 states have internal predecessors, (415), 12 states have call successors, (12), 8 states have call predecessors, (12), 19 states have return successors, (48), 12 states have call predecessors, (48), 12 states have call successors, (48) [2025-04-29 11:23:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 475 transitions. [2025-04-29 11:23:06,793 INFO L79 Accepts]: Start accepts. Automaton has 348 states and 475 transitions. Word has length 28 [2025-04-29 11:23:06,793 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:06,793 INFO L485 AbstractCegarLoop]: Abstraction has 348 states and 475 transitions. [2025-04-29 11:23:06,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:06,794 INFO L278 IsEmpty]: Start isEmpty. Operand 348 states and 475 transitions. [2025-04-29 11:23:06,794 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:23:06,794 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:06,794 INFO L218 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] [2025-04-29 11:23:06,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-29 11:23:06,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:06,995 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-04-29 11:23:06,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1105949385, now seen corresponding path program 1 times [2025-04-29 11:23:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:06,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22424752] [2025-04-29 11:23:06,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:06,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:06,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:06,997 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:06,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-29 11:23:07,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:23:07,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:23:07,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:07,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:07,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:23:07,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... Killed by 15