./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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 ../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 08:01:51,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 08:01:51,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 08:01:51,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 08:01:51,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 08:01:51,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 08:01:51,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 08:01:51,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 08:01:51,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 08:01:51,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 08:01:51,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 08:01:51,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 08:01:51,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 08:01:51,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 08:01:51,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 08:01:51,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 08:01:51,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:01:51,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 08:01:51,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 08:01:51,375 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 -> 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 [2025-03-04 08:01:51,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 08:01:51,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 08:01:51,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 08:01:51,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 08:01:51,620 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 08:01:51,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-03-04 08:01:52,710 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7883fd05/6bb4d8908d704f31be7bbc6746700eec/FLAGcc6073914 [2025-03-04 08:01:52,932 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 08:01:52,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-03-04 08:01:52,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7883fd05/6bb4d8908d704f31be7bbc6746700eec/FLAGcc6073914 [2025-03-04 08:01:53,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7883fd05/6bb4d8908d704f31be7bbc6746700eec [2025-03-04 08:01:53,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 08:01:53,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 08:01:53,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 08:01:53,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 08:01:53,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 08:01:53,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fb15ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53, skipping insertion in model container [2025-03-04 08:01:53,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 08:01:53,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:01:53,455 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 08:01:53,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:01:53,497 INFO L204 MainTranslator]: Completed translation [2025-03-04 08:01:53,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53 WrapperNode [2025-03-04 08:01:53,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 08:01:53,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 08:01:53,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 08:01:53,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 08:01:53,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,531 INFO L138 Inliner]: procedures = 42, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2025-03-04 08:01:53,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 08:01:53,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 08:01:53,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 08:01:53,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 08:01:53,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,558 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-04 08:01:53,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 08:01:53,576 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 08:01:53,576 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 08:01:53,576 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 08:01:53,577 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (1/1) ... [2025-03-04 08:01:53,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:01:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:53,603 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-03-04 08:01:53,604 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-03-04 08:01:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 08:01:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 08:01:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 08:01:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 08:01:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 08:01:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 08:01:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 08:01:53,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 08:01:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 08:01:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 08:01:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 08:01:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 08:01:53,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 08:01:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 08:01:53,685 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 08:01:53,686 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 08:01:53,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-03-04 08:01:53,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: call ULTIMATE.dealloc(parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset);havoc parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset; [2025-03-04 08:01:53,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset; [2025-03-04 08:01:53,919 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-03-04 08:01:53,919 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 08:01:53,925 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 08:01:53,926 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 08:01:53,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:01:53 BoogieIcfgContainer [2025-03-04 08:01:53,926 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 08:01:53,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 08:01:53,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 08:01:53,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 08:01:53,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 08:01:53" (1/3) ... [2025-03-04 08:01:53,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c5092a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:01:53, skipping insertion in model container [2025-03-04 08:01:53,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:01:53" (2/3) ... [2025-03-04 08:01:53,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c5092a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:01:53, skipping insertion in model container [2025-03-04 08:01:53,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:01:53" (3/3) ... [2025-03-04 08:01:53,936 INFO L128 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2025-03-04 08:01:53,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 08:01:53,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i that has 1 procedures, 78 locations, 1 initial locations, 4 loop locations, and 24 error locations. [2025-03-04 08:01:53,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 08:01:53,981 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d17254, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 08:01:53,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-04 08:01:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.8113207547169812) internal successors, (96), 77 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:01:53,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:53,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:01:53,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:53,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:53,994 INFO L85 PathProgramCache]: Analyzing trace with hash 4308574, now seen corresponding path program 1 times [2025-03-04 08:01:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:54,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513883141] [2025-03-04 08:01:54,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:54,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:54,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:01:54,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:01:54,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:54,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513883141] [2025-03-04 08:01:54,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513883141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:54,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:54,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:01:54,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332908157] [2025-03-04 08:01:54,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:54,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:01:54,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:54,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:01:54,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:01:54,149 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.8113207547169812) internal successors, (96), 77 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:54,177 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2025-03-04 08:01:54,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:01:54,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:01:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:54,183 INFO L225 Difference]: With dead ends: 81 [2025-03-04 08:01:54,183 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 08:01:54,184 INFO L434 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-03-04 08:01:54,186 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:54,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 08:01:54,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-03-04 08:01:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 75 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2025-03-04 08:01:54,213 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 4 [2025-03-04 08:01:54,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:54,213 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2025-03-04 08:01:54,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2025-03-04 08:01:54,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:01:54,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:54,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:01:54,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 08:01:54,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:54,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:54,215 INFO L85 PathProgramCache]: Analyzing trace with hash 4308734, now seen corresponding path program 1 times [2025-03-04 08:01:54,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:54,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510124669] [2025-03-04 08:01:54,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:54,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:54,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:01:54,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:01:54,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:54,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510124669] [2025-03-04 08:01:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510124669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:54,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:54,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:01:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983901880] [2025-03-04 08:01:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:54,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:01:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:54,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:01:54,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:01:54,265 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:54,313 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2025-03-04 08:01:54,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:01:54,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:01:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:54,314 INFO L225 Difference]: With dead ends: 74 [2025-03-04 08:01:54,314 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 08:01:54,314 INFO L434 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-03-04 08:01:54,315 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:54,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 59 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 08:01:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 08:01:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 73 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2025-03-04 08:01:54,320 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 4 [2025-03-04 08:01:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:54,320 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2025-03-04 08:01:54,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2025-03-04 08:01:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:01:54,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:54,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:01:54,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 08:01:54,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:54,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash 4308735, now seen corresponding path program 1 times [2025-03-04 08:01:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:54,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967602899] [2025-03-04 08:01:54,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:54,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:01:54,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:01:54,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:54,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:54,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:54,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967602899] [2025-03-04 08:01:54,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967602899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:54,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:54,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:01:54,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113304464] [2025-03-04 08:01:54,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:54,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:01:54,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:54,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:01:54,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:01:54,401 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:54,458 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2025-03-04 08:01:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:01:54,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:01:54,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:54,459 INFO L225 Difference]: With dead ends: 76 [2025-03-04 08:01:54,459 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 08:01:54,459 INFO L434 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-03-04 08:01:54,460 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:54,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 140 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 08:01:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-04 08:01:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 74 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2025-03-04 08:01:54,464 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 4 [2025-03-04 08:01:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:54,464 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2025-03-04 08:01:54,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2025-03-04 08:01:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 08:01:54,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:54,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:54,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 08:01:54,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:54,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:54,465 INFO L85 PathProgramCache]: Analyzing trace with hash -487450838, now seen corresponding path program 1 times [2025-03-04 08:01:54,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:54,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704568989] [2025-03-04 08:01:54,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:54,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 08:01:54,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 08:01:54,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:54,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:54,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:54,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704568989] [2025-03-04 08:01:54,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704568989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:54,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67181408] [2025-03-04 08:01:54,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:54,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:54,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:54,516 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-03-04 08:01:54,517 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-03-04 08:01:54,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 08:01:54,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 08:01:54,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:54,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:54,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 08:01:54,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:54,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:01:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67181408] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:01:54,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:01:54,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 08:01:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767368735] [2025-03-04 08:01:54,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:01:54,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 08:01:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:54,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 08:01:54,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:01:54,605 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:54,629 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2025-03-04 08:01:54,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:01:54,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 08:01:54,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:54,633 INFO L225 Difference]: With dead ends: 83 [2025-03-04 08:01:54,633 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 08:01:54,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:01:54,634 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 242 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-03-04 08:01:54,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 242 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 08:01:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 08:01:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 82 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2025-03-04 08:01:54,638 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 7 [2025-03-04 08:01:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:54,639 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-03-04 08:01:54,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2025-03-04 08:01:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 08:01:54,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:54,639 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 08:01:54,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 08:01:54,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:54,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:54,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -487450678, now seen corresponding path program 1 times [2025-03-04 08:01:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127068376] [2025-03-04 08:01:54,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:54,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 08:01:54,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 08:01:54,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:54,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:54,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127068376] [2025-03-04 08:01:54,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127068376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:54,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948535790] [2025-03-04 08:01:54,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:54,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:54,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:54,943 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-03-04 08:01:54,945 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-03-04 08:01:54,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 08:01:54,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 08:01:54,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:54,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:54,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 08:01:54,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:55,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 08:01:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:55,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:01:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948535790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:01:55,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:01:55,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 08:01:55,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430260079] [2025-03-04 08:01:55,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:01:55,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 08:01:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:55,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 08:01:55,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:01:55,086 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:55,162 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2025-03-04 08:01:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:01:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 08:01:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:55,163 INFO L225 Difference]: With dead ends: 84 [2025-03-04 08:01:55,163 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 08:01:55,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 08:01:55,163 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 5 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:55,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 254 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:01:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 08:01:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 08:01:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.564516129032258) internal successors, (97), 83 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2025-03-04 08:01:55,166 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 7 [2025-03-04 08:01:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:55,166 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-03-04 08:01:55,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2025-03-04 08:01:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 08:01:55,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:55,167 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2025-03-04 08:01:55,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 08:01:55,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:55,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:55,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash 950908575, now seen corresponding path program 2 times [2025-03-04 08:01:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487019090] [2025-03-04 08:01:55,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:01:55,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:55,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 08:01:55,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 08:01:55,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 08:01:55,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 08:01:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487019090] [2025-03-04 08:01:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487019090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:55,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:55,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:01:55,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632859401] [2025-03-04 08:01:55,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:55,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:01:55,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:55,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:01:55,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:01:55,408 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:55,441 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2025-03-04 08:01:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:01:55,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 08:01:55,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:55,442 INFO L225 Difference]: With dead ends: 83 [2025-03-04 08:01:55,442 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 08:01:55,442 INFO L434 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-03-04 08:01:55,443 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:55,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 08:01:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 08:01:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 82 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2025-03-04 08:01:55,448 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 16 [2025-03-04 08:01:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:55,448 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2025-03-04 08:01:55,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2025-03-04 08:01:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 08:01:55,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:55,448 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-03-04 08:01:55,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 08:01:55,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:55,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:55,449 INFO L85 PathProgramCache]: Analyzing trace with hash 950908735, now seen corresponding path program 2 times [2025-03-04 08:01:55,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:55,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135279565] [2025-03-04 08:01:55,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:01:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:55,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 08:01:55,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:01:55,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:01:55,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:55,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:55,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135279565] [2025-03-04 08:01:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135279565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:55,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984563260] [2025-03-04 08:01:55,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:01:55,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:55,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:55,654 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-03-04 08:01:55,656 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-03-04 08:01:55,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 08:01:55,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:01:55,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:01:55,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:55,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 08:01:55,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:55,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 08:01:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:55,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 08:01:55,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984563260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:55,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 08:01:55,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-04 08:01:55,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442613000] [2025-03-04 08:01:55,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:55,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 08:01:55,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:55,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 08:01:55,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 08:01:55,818 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:55,888 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2025-03-04 08:01:55,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 08:01:55,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 08:01:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:55,889 INFO L225 Difference]: With dead ends: 83 [2025-03-04 08:01:55,889 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 08:01:55,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 08:01:55,889 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:55,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 251 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:01:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 08:01:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-03-04 08:01:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.540983606557377) internal successors, (94), 80 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2025-03-04 08:01:55,896 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 16 [2025-03-04 08:01:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:55,896 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2025-03-04 08:01:55,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2025-03-04 08:01:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 08:01:55,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:55,896 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:55,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 08:01:56,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:56,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:56,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:56,097 INFO L85 PathProgramCache]: Analyzing trace with hash 666209656, now seen corresponding path program 1 times [2025-03-04 08:01:56,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:56,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326603005] [2025-03-04 08:01:56,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:56,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:56,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 08:01:56,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 08:01:56,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:56,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 08:01:56,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:56,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326603005] [2025-03-04 08:01:56,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326603005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:56,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:56,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 08:01:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164544552] [2025-03-04 08:01:56,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:56,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 08:01:56,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:56,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 08:01:56,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:01:56,141 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:56,176 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2025-03-04 08:01:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 08:01:56,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 08:01:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:56,177 INFO L225 Difference]: With dead ends: 81 [2025-03-04 08:01:56,177 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 08:01:56,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03-04 08:01:56,178 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 130 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:56,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 58 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 08:01:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 08:01:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 80 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2025-03-04 08:01:56,180 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 20 [2025-03-04 08:01:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:56,181 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2025-03-04 08:01:56,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2025-03-04 08:01:56,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 08:01:56,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:56,183 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:56,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 08:01:56,183 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:56,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 666213498, now seen corresponding path program 1 times [2025-03-04 08:01:56,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:56,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009224639] [2025-03-04 08:01:56,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:56,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 08:01:56,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 08:01:56,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:56,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:56,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:56,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009224639] [2025-03-04 08:01:56,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009224639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:56,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066276070] [2025-03-04 08:01:56,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:56,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:56,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:56,260 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-03-04 08:01:56,261 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-03-04 08:01:56,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 08:01:56,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 08:01:56,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:56,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:56,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 08:01:56,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:56,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:01:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:01:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066276070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:01:56,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:01:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 08:01:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615674682] [2025-03-04 08:01:56,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:01:56,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 08:01:56,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:56,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 08:01:56,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 08:01:56,373 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:56,399 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2025-03-04 08:01:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 08:01:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 08:01:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:56,400 INFO L225 Difference]: With dead ends: 93 [2025-03-04 08:01:56,400 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 08:01:56,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 08:01:56,401 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:56,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 08:01:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 08:01:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 92 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2025-03-04 08:01:56,404 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 20 [2025-03-04 08:01:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:56,404 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2025-03-04 08:01:56,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2025-03-04 08:01:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 08:01:56,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:56,405 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:56,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 08:01:56,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:56,609 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:56,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:56,609 INFO L85 PathProgramCache]: Analyzing trace with hash -475458374, now seen corresponding path program 2 times [2025-03-04 08:01:56,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:56,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915006765] [2025-03-04 08:01:56,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:01:56,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:56,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 08:01:56,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 32 statements. [2025-03-04 08:01:56,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 08:01:56,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:01:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915006765] [2025-03-04 08:01:56,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915006765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:56,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:01:56,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328646329] [2025-03-04 08:01:56,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:56,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 08:01:56,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:56,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 08:01:56,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:01:56,657 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:56,705 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2025-03-04 08:01:56,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 08:01:56,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-04 08:01:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:56,706 INFO L225 Difference]: With dead ends: 85 [2025-03-04 08:01:56,706 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 08:01:56,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 08:01:56,706 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 114 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:56,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 52 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 08:01:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 08:01:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2025-03-04 08:01:56,712 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 32 [2025-03-04 08:01:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:56,712 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2025-03-04 08:01:56,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2025-03-04 08:01:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 08:01:56,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:56,713 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:56,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 08:01:56,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:56,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash -475458373, now seen corresponding path program 1 times [2025-03-04 08:01:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:56,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703367806] [2025-03-04 08:01:56,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:56,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 08:01:56,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 08:01:56,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:56,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 08:01:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703367806] [2025-03-04 08:01:56,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703367806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:56,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:56,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 08:01:56,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098127227] [2025-03-04 08:01:56,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:56,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 08:01:56,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:56,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 08:01:56,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:01:56,907 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:56,979 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2025-03-04 08:01:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 08:01:56,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-04 08:01:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:56,981 INFO L225 Difference]: With dead ends: 131 [2025-03-04 08:01:56,981 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 08:01:56,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:01:56,982 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 55 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:56,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 186 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:01:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 08:01:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2025-03-04 08:01:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 120 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2025-03-04 08:01:56,988 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 32 [2025-03-04 08:01:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:56,989 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2025-03-04 08:01:56,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2025-03-04 08:01:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 08:01:56,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:56,989 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:56,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 08:01:56,990 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:56,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:56,990 INFO L85 PathProgramCache]: Analyzing trace with hash 421781887, now seen corresponding path program 1 times [2025-03-04 08:01:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145792167] [2025-03-04 08:01:56,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:56,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 08:01:57,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 08:01:57,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:57,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:01:57,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:57,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145792167] [2025-03-04 08:01:57,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145792167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:57,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:57,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 08:01:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938099913] [2025-03-04 08:01:57,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:57,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 08:01:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:57,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 08:01:57,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:01:57,130 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:57,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:57,229 INFO L93 Difference]: Finished difference Result 195 states and 261 transitions. [2025-03-04 08:01:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:01:57,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-04 08:01:57,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:57,230 INFO L225 Difference]: With dead ends: 195 [2025-03-04 08:01:57,230 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 08:01:57,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:01:57,230 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 142 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:57,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 246 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:01:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 08:01:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 144. [2025-03-04 08:01:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.393939393939394) internal successors, (184), 143 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2025-03-04 08:01:57,237 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 35 [2025-03-04 08:01:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:57,238 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2025-03-04 08:01:57,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2025-03-04 08:01:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 08:01:57,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:57,239 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:57,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 08:01:57,240 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:57,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:57,240 INFO L85 PathProgramCache]: Analyzing trace with hash 961793893, now seen corresponding path program 1 times [2025-03-04 08:01:57,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:57,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544271925] [2025-03-04 08:01:57,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:57,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 08:01:57,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 08:01:57,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:57,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 08:01:57,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:57,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544271925] [2025-03-04 08:01:57,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544271925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:57,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528057667] [2025-03-04 08:01:57,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:57,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:57,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:57,482 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-03-04 08:01:57,483 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-03-04 08:01:57,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 08:01:57,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 08:01:57,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:57,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:57,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 08:01:57,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:57,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 08:01:57,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 08:01:57,676 INFO L378 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-03-04 08:01:57,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 08:01:57,689 INFO L378 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-03-04 08:01:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:01:57,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:01:57,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 08:01:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:01:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528057667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:01:57,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:01:57,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-03-04 08:01:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801719883] [2025-03-04 08:01:57,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:01:57,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 08:01:57,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:57,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 08:01:57,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 08:01:57,956 INFO L87 Difference]: Start difference. First operand 144 states and 184 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:58,254 INFO L93 Difference]: Finished difference Result 368 states and 516 transitions. [2025-03-04 08:01:58,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 08:01:58,255 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-04 08:01:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:58,256 INFO L225 Difference]: With dead ends: 368 [2025-03-04 08:01:58,256 INFO L226 Difference]: Without dead ends: 368 [2025-03-04 08:01:58,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-03-04 08:01:58,256 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 554 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:58,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 504 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 08:01:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-04 08:01:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 166. [2025-03-04 08:01:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 156 states have (on average 1.358974358974359) internal successors, (212), 165 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2025-03-04 08:01:58,262 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 39 [2025-03-04 08:01:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:58,262 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2025-03-04 08:01:58,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2025-03-04 08:01:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 08:01:58,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:58,264 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:58,271 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-03-04 08:01:58,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 08:01:58,464 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:58,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash 922608722, now seen corresponding path program 1 times [2025-03-04 08:01:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:58,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625631484] [2025-03-04 08:01:58,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:58,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:58,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 08:01:58,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 08:01:58,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:58,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 08:01:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:58,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625631484] [2025-03-04 08:01:58,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625631484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:58,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178085947] [2025-03-04 08:01:58,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:58,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:58,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:58,677 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-03-04 08:01:58,679 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-03-04 08:01:58,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 08:01:58,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 08:01:58,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:58,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:58,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 08:01:58,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:58,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 08:01:58,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 08:01:58,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 08:01:58,898 INFO L378 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-03-04 08:01:58,907 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 08:01:58,907 INFO L378 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-03-04 08:01:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:01:58,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:01:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:01:59,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178085947] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:01:59,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:01:59,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-04 08:01:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702769742] [2025-03-04 08:01:59,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:01:59,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 08:01:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:59,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 08:01:59,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-04 08:01:59,429 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:59,637 INFO L93 Difference]: Finished difference Result 392 states and 508 transitions. [2025-03-04 08:01:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 08:01:59,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-04 08:01:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:59,640 INFO L225 Difference]: With dead ends: 392 [2025-03-04 08:01:59,640 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 08:01:59,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-04 08:01:59,640 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 618 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:59,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 564 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 08:01:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 08:01:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 360. [2025-03-04 08:01:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 351 states have (on average 1.3903133903133904) internal successors, (488), 359 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 488 transitions. [2025-03-04 08:01:59,648 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 488 transitions. Word has length 39 [2025-03-04 08:01:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:59,648 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 488 transitions. [2025-03-04 08:01:59,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 488 transitions. [2025-03-04 08:01:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 08:01:59,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:59,649 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:59,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 08:01:59,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:59,854 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:59,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1463957264, now seen corresponding path program 1 times [2025-03-04 08:01:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:59,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869819040] [2025-03-04 08:01:59,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:59,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 08:01:59,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 08:01:59,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:59,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:01:59,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:59,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869819040] [2025-03-04 08:01:59,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869819040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:59,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 08:01:59,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160779299] [2025-03-04 08:01:59,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:59,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 08:01:59,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:59,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 08:01:59,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:01:59,914 INFO L87 Difference]: Start difference. First operand 360 states and 488 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:59,960 INFO L93 Difference]: Finished difference Result 376 states and 499 transitions. [2025-03-04 08:01:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:01:59,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-04 08:01:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:59,962 INFO L225 Difference]: With dead ends: 376 [2025-03-04 08:01:59,962 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 08:01:59,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:01:59,963 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 222 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-03-04 08:01:59,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 222 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:01:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 08:01:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 372. [2025-03-04 08:01:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 363 states have (on average 1.3636363636363635) internal successors, (495), 371 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 495 transitions. [2025-03-04 08:01:59,969 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 495 transitions. Word has length 40 [2025-03-04 08:01:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:59,969 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 495 transitions. [2025-03-04 08:01:59,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 495 transitions. [2025-03-04 08:01:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 08:01:59,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:59,970 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:01:59,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 08:01:59,970 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:01:59,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1035530635, now seen corresponding path program 1 times [2025-03-04 08:01:59,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:59,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792280341] [2025-03-04 08:01:59,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:59,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:59,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 08:01:59,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 08:01:59,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:59,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:01:59,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:59,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792280341] [2025-03-04 08:01:59,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792280341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:01:59,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:01:59,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:01:59,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066473829] [2025-03-04 08:01:59,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:01:59,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:01:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:59,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:01:59,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:01:59,996 INFO L87 Difference]: Start difference. First operand 372 states and 495 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:00,004 INFO L93 Difference]: Finished difference Result 392 states and 515 transitions. [2025-03-04 08:02:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-04 08:02:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:00,005 INFO L225 Difference]: With dead ends: 392 [2025-03-04 08:02:00,005 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 08:02:00,005 INFO L434 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-03-04 08:02:00,006 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:00,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:00,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 08:02:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-04 08:02:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 383 states have (on average 1.3446475195822454) internal successors, (515), 391 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 515 transitions. [2025-03-04 08:02:00,018 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 515 transitions. Word has length 44 [2025-03-04 08:02:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:00,018 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 515 transitions. [2025-03-04 08:02:00,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 515 transitions. [2025-03-04 08:02:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 08:02:00,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:00,021 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:00,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 08:02:00,021 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:00,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:00,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1290271029, now seen corresponding path program 1 times [2025-03-04 08:02:00,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:00,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909012706] [2025-03-04 08:02:00,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:00,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:00,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 08:02:00,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 08:02:00,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:00,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:00,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909012706] [2025-03-04 08:02:00,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909012706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:00,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:00,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 08:02:00,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250644970] [2025-03-04 08:02:00,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:00,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 08:02:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:00,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 08:02:00,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:02:00,089 INFO L87 Difference]: Start difference. First operand 392 states and 515 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:00,157 INFO L93 Difference]: Finished difference Result 400 states and 513 transitions. [2025-03-04 08:02:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 08:02:00,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-04 08:02:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:00,158 INFO L225 Difference]: With dead ends: 400 [2025-03-04 08:02:00,158 INFO L226 Difference]: Without dead ends: 400 [2025-03-04 08:02:00,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 08:02:00,159 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 57 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 260 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-03-04 08:02:00,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 260 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:02:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-04 08:02:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 390. [2025-03-04 08:02:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 381 states have (on average 1.3333333333333333) internal successors, (508), 389 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 508 transitions. [2025-03-04 08:02:00,169 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 508 transitions. Word has length 46 [2025-03-04 08:02:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:00,170 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 508 transitions. [2025-03-04 08:02:00,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 508 transitions. [2025-03-04 08:02:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 08:02:00,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:00,171 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 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-03-04 08:02:00,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 08:02:00,171 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:00,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1493686896, now seen corresponding path program 1 times [2025-03-04 08:02:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:00,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225740345] [2025-03-04 08:02:00,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:00,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 08:02:00,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 08:02:00,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:00,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:00,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:00,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225740345] [2025-03-04 08:02:00,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225740345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:00,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:00,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 08:02:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104073872] [2025-03-04 08:02:00,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:00,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 08:02:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:00,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 08:02:00,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 08:02:00,245 INFO L87 Difference]: Start difference. First operand 390 states and 508 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:00,288 INFO L93 Difference]: Finished difference Result 433 states and 566 transitions. [2025-03-04 08:02:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:02:00,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-04 08:02:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:00,290 INFO L225 Difference]: With dead ends: 433 [2025-03-04 08:02:00,291 INFO L226 Difference]: Without dead ends: 433 [2025-03-04 08:02:00,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-04 08:02:00,291 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:00,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 212 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-04 08:02:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 400. [2025-03-04 08:02:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 391 states have (on average 1.3171355498721227) internal successors, (515), 399 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 515 transitions. [2025-03-04 08:02:00,299 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 515 transitions. Word has length 49 [2025-03-04 08:02:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:00,299 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 515 transitions. [2025-03-04 08:02:00,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 515 transitions. [2025-03-04 08:02:00,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 08:02:00,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:00,300 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:00,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 08:02:00,301 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:00,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1136048361, now seen corresponding path program 2 times [2025-03-04 08:02:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:00,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591210126] [2025-03-04 08:02:00,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:02:00,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:00,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 08:02:00,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 08:02:00,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:02:00,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:00,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:00,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591210126] [2025-03-04 08:02:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591210126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:00,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537108709] [2025-03-04 08:02:00,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:02:00,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:00,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:00,547 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-03-04 08:02:00,548 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-03-04 08:02:00,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 08:02:00,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 08:02:00,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:02:00,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:00,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 08:02:00,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-04 08:02:00,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 08:02:00,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537108709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:00,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 08:02:00,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 17 [2025-03-04 08:02:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242701834] [2025-03-04 08:02:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:00,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 08:02:00,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:00,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 08:02:00,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2025-03-04 08:02:00,785 INFO L87 Difference]: Start difference. First operand 400 states and 515 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:01,016 INFO L93 Difference]: Finished difference Result 419 states and 537 transitions. [2025-03-04 08:02:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 08:02:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-04 08:02:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:01,018 INFO L225 Difference]: With dead ends: 419 [2025-03-04 08:02:01,018 INFO L226 Difference]: Without dead ends: 419 [2025-03-04 08:02:01,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-03-04 08:02:01,020 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 57 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:01,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 494 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 08:02:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-04 08:02:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 399. [2025-03-04 08:02:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 390 states have (on average 1.3153846153846154) internal successors, (513), 398 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 513 transitions. [2025-03-04 08:02:01,029 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 513 transitions. Word has length 51 [2025-03-04 08:02:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:01,029 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 513 transitions. [2025-03-04 08:02:01,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 513 transitions. [2025-03-04 08:02:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 08:02:01,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:01,031 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 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-03-04 08:02:01,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 08:02:01,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:01,232 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:01,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1728995081, now seen corresponding path program 1 times [2025-03-04 08:02:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23285282] [2025-03-04 08:02:01,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:01,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 08:02:01,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 08:02:01,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:01,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 08:02:01,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:01,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23285282] [2025-03-04 08:02:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23285282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:01,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:01,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 08:02:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972140971] [2025-03-04 08:02:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:01,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 08:02:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:01,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 08:02:01,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:02:01,411 INFO L87 Difference]: Start difference. First operand 399 states and 513 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:01,451 INFO L93 Difference]: Finished difference Result 398 states and 512 transitions. [2025-03-04 08:02:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:02:01,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-04 08:02:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:01,453 INFO L225 Difference]: With dead ends: 398 [2025-03-04 08:02:01,453 INFO L226 Difference]: Without dead ends: 395 [2025-03-04 08:02:01,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:02:01,453 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 37 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:01,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 199 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-04 08:02:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 383. [2025-03-04 08:02:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 375 states have (on average 1.288) internal successors, (483), 382 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 483 transitions. [2025-03-04 08:02:01,460 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 483 transitions. Word has length 52 [2025-03-04 08:02:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:01,460 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 483 transitions. [2025-03-04 08:02:01,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 483 transitions. [2025-03-04 08:02:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 08:02:01,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:01,461 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:01,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 08:02:01,461 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:01,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:01,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1090270761, now seen corresponding path program 1 times [2025-03-04 08:02:01,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:01,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157120903] [2025-03-04 08:02:01,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:01,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:01,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 08:02:01,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 08:02:01,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:01,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 08:02:01,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157120903] [2025-03-04 08:02:01,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157120903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793831720] [2025-03-04 08:02:01,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:01,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:01,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:01,695 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-03-04 08:02:01,696 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-03-04 08:02:01,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 08:02:01,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 08:02:01,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:01,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:01,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 08:02:01,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:01,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 08:02:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 08:02:01,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 08:02:01,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793831720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:01,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 08:02:01,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2025-03-04 08:02:01,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494859257] [2025-03-04 08:02:01,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:01,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 08:02:01,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:01,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 08:02:01,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-03-04 08:02:01,872 INFO L87 Difference]: Start difference. First operand 383 states and 483 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:02,010 INFO L93 Difference]: Finished difference Result 379 states and 472 transitions. [2025-03-04 08:02:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 08:02:02,010 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-04 08:02:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:02,011 INFO L225 Difference]: With dead ends: 379 [2025-03-04 08:02:02,011 INFO L226 Difference]: Without dead ends: 379 [2025-03-04 08:02:02,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-04 08:02:02,012 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 76 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:02,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 380 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:02:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-04 08:02:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 361. [2025-03-04 08:02:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 353 states have (on average 1.2832861189801699) internal successors, (453), 360 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 453 transitions. [2025-03-04 08:02:02,017 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 453 transitions. Word has length 53 [2025-03-04 08:02:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:02,017 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 453 transitions. [2025-03-04 08:02:02,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 453 transitions. [2025-03-04 08:02:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 08:02:02,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:02,018 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:02,024 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-03-04 08:02:02,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 08:02:02,218 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:02,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash 247611938, now seen corresponding path program 1 times [2025-03-04 08:02:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:02,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031735520] [2025-03-04 08:02:02,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:02,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:02,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 08:02:02,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 08:02:02,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:02,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:02,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031735520] [2025-03-04 08:02:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031735520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954159621] [2025-03-04 08:02:02,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:02,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:02,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:02,286 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-03-04 08:02:02,287 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-03-04 08:02:02,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 08:02:02,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 08:02:02,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:02,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:02,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 08:02:02,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:02,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:02,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954159621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:02,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:02,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-04 08:02:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361611186] [2025-03-04 08:02:02,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:02,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 08:02:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:02,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 08:02:02,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:02:02,425 INFO L87 Difference]: Start difference. First operand 361 states and 453 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:02,501 INFO L93 Difference]: Finished difference Result 362 states and 439 transitions. [2025-03-04 08:02:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 08:02:02,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-04 08:02:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:02,503 INFO L225 Difference]: With dead ends: 362 [2025-03-04 08:02:02,503 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 08:02:02,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-04 08:02:02,505 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 92 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:02,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 300 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:02:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 08:02:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 349. [2025-03-04 08:02:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 341 states have (on average 1.2697947214076246) internal successors, (433), 348 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 433 transitions. [2025-03-04 08:02:02,511 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 433 transitions. Word has length 53 [2025-03-04 08:02:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:02,511 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 433 transitions. [2025-03-04 08:02:02,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 433 transitions. [2025-03-04 08:02:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 08:02:02,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:02,511 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-03-04 08:02:02,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 08:02:02,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:02,712 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:02,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1108412037, now seen corresponding path program 1 times [2025-03-04 08:02:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:02,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27008262] [2025-03-04 08:02:02,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:02,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 08:02:02,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 08:02:02,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:02,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:02,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:02,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27008262] [2025-03-04 08:02:02,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27008262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:02,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:02,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:02:02,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480783099] [2025-03-04 08:02:02,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:02,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:02,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:02,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:02,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:02,773 INFO L87 Difference]: Start difference. First operand 349 states and 433 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:02,791 INFO L93 Difference]: Finished difference Result 348 states and 428 transitions. [2025-03-04 08:02:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:02,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-04 08:02:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:02,792 INFO L225 Difference]: With dead ends: 348 [2025-03-04 08:02:02,792 INFO L226 Difference]: Without dead ends: 348 [2025-03-04 08:02:02,793 INFO L434 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-03-04 08:02:02,793 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:02,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-04 08:02:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2025-03-04 08:02:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 341 states have (on average 1.2551319648093842) internal successors, (428), 347 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 428 transitions. [2025-03-04 08:02:02,798 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 428 transitions. Word has length 55 [2025-03-04 08:02:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:02,798 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 428 transitions. [2025-03-04 08:02:02,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 428 transitions. [2025-03-04 08:02:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 08:02:02,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:02,800 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-03-04 08:02:02,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 08:02:02,800 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:02,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1108412038, now seen corresponding path program 1 times [2025-03-04 08:02:02,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:02,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700907442] [2025-03-04 08:02:02,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:02,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:02,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 08:02:02,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 08:02:02,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:02,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:02,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:02,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700907442] [2025-03-04 08:02:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700907442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:02,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:02,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 08:02:02,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325071346] [2025-03-04 08:02:02,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:02,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 08:02:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:02,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 08:02:02,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:02:02,882 INFO L87 Difference]: Start difference. First operand 348 states and 428 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:02,961 INFO L93 Difference]: Finished difference Result 592 states and 740 transitions. [2025-03-04 08:02:02,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:02:02,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-04 08:02:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:02,963 INFO L225 Difference]: With dead ends: 592 [2025-03-04 08:02:02,963 INFO L226 Difference]: Without dead ends: 559 [2025-03-04 08:02:02,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 08:02:02,964 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 83 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:02,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 243 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:02:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-04 08:02:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 417. [2025-03-04 08:02:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 410 states have (on average 1.275609756097561) internal successors, (523), 416 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 523 transitions. [2025-03-04 08:02:02,972 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 523 transitions. Word has length 55 [2025-03-04 08:02:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:02,972 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 523 transitions. [2025-03-04 08:02:02,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 523 transitions. [2025-03-04 08:02:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 08:02:02,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:02,973 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-03-04 08:02:02,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 08:02:02,973 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:02,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash 602853413, now seen corresponding path program 1 times [2025-03-04 08:02:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:02,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481317874] [2025-03-04 08:02:02,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:02,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:02,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 08:02:02,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 08:02:02,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:02,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:03,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:03,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481317874] [2025-03-04 08:02:03,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481317874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:03,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:03,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 08:02:03,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443556433] [2025-03-04 08:02:03,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:03,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 08:02:03,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:03,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 08:02:03,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 08:02:03,047 INFO L87 Difference]: Start difference. First operand 417 states and 523 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:03,095 INFO L93 Difference]: Finished difference Result 395 states and 493 transitions. [2025-03-04 08:02:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 08:02:03,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-04 08:02:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:03,097 INFO L225 Difference]: With dead ends: 395 [2025-03-04 08:02:03,097 INFO L226 Difference]: Without dead ends: 379 [2025-03-04 08:02:03,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:02:03,098 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:03,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 154 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-04 08:02:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-03-04 08:02:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 372 states have (on average 1.282258064516129) internal successors, (477), 378 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 477 transitions. [2025-03-04 08:02:03,108 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 477 transitions. Word has length 55 [2025-03-04 08:02:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:03,108 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 477 transitions. [2025-03-04 08:02:03,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 477 transitions. [2025-03-04 08:02:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 08:02:03,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:03,109 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:03,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 08:02:03,110 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:03,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:03,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1564576288, now seen corresponding path program 1 times [2025-03-04 08:02:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:03,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055985186] [2025-03-04 08:02:03,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:03,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:03,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 08:02:03,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 08:02:03,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:03,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 08:02:03,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055985186] [2025-03-04 08:02:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055985186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353790152] [2025-03-04 08:02:03,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:03,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:03,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:03,317 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-03-04 08:02:03,318 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-03-04 08:02:03,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 08:02:03,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 08:02:03,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:03,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:03,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 08:02:03,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:03,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-04 08:02:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 08:02:03,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:03,668 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-04 08:02:03,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2025-03-04 08:02:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 08:02:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353790152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:03,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2025-03-04 08:02:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70669573] [2025-03-04 08:02:03,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:03,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 08:02:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:03,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 08:02:03,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2025-03-04 08:02:03,733 INFO L87 Difference]: Start difference. First operand 379 states and 477 transitions. Second operand has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:05,030 INFO L93 Difference]: Finished difference Result 1214 states and 1599 transitions. [2025-03-04 08:02:05,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 08:02:05,030 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-04 08:02:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:05,033 INFO L225 Difference]: With dead ends: 1214 [2025-03-04 08:02:05,034 INFO L226 Difference]: Without dead ends: 1214 [2025-03-04 08:02:05,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 08:02:05,035 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 629 mSDsluCounter, 3685 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 3934 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:05,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 3934 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 08:02:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-04 08:02:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 457. [2025-03-04 08:02:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 450 states have (on average 1.2755555555555556) internal successors, (574), 456 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 574 transitions. [2025-03-04 08:02:05,046 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 574 transitions. Word has length 58 [2025-03-04 08:02:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:05,046 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 574 transitions. [2025-03-04 08:02:05,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 574 transitions. [2025-03-04 08:02:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 08:02:05,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:05,047 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:05,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 08:02:05,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 08:02:05,247 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:05,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1387652843, now seen corresponding path program 2 times [2025-03-04 08:02:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:05,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941360234] [2025-03-04 08:02:05,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:02:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:05,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-04 08:02:05,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 60 statements. [2025-03-04 08:02:05,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 08:02:05,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-04 08:02:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:05,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941360234] [2025-03-04 08:02:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941360234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:05,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:05,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 08:02:05,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608601643] [2025-03-04 08:02:05,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:05,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 08:02:05,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:05,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 08:02:05,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 08:02:05,333 INFO L87 Difference]: Start difference. First operand 457 states and 574 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:05,522 INFO L93 Difference]: Finished difference Result 640 states and 790 transitions. [2025-03-04 08:02:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 08:02:05,522 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-04 08:02:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:05,524 INFO L225 Difference]: With dead ends: 640 [2025-03-04 08:02:05,524 INFO L226 Difference]: Without dead ends: 640 [2025-03-04 08:02:05,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-03-04 08:02:05,524 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 209 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:05,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 243 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:02:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-04 08:02:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 496. [2025-03-04 08:02:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 489 states have (on average 1.2658486707566463) internal successors, (619), 495 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 619 transitions. [2025-03-04 08:02:05,538 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 619 transitions. Word has length 60 [2025-03-04 08:02:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:05,538 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 619 transitions. [2025-03-04 08:02:05,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 619 transitions. [2025-03-04 08:02:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 08:02:05,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:05,540 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:05,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 08:02:05,540 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:05,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:05,541 INFO L85 PathProgramCache]: Analyzing trace with hash 965502638, now seen corresponding path program 1 times [2025-03-04 08:02:05,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:05,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981176297] [2025-03-04 08:02:05,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:05,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:05,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 08:02:05,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 08:02:05,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:05,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:05,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981176297] [2025-03-04 08:02:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981176297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:05,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 08:02:05,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536166798] [2025-03-04 08:02:05,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:05,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 08:02:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:05,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 08:02:05,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 08:02:05,720 INFO L87 Difference]: Start difference. First operand 496 states and 619 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:05,841 INFO L93 Difference]: Finished difference Result 611 states and 756 transitions. [2025-03-04 08:02:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 08:02:05,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-04 08:02:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:05,844 INFO L225 Difference]: With dead ends: 611 [2025-03-04 08:02:05,844 INFO L226 Difference]: Without dead ends: 611 [2025-03-04 08:02:05,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-04 08:02:05,844 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 146 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:05,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 190 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:02:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-04 08:02:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 541. [2025-03-04 08:02:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 534 states have (on average 1.2584269662921348) internal successors, (672), 540 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 672 transitions. [2025-03-04 08:02:05,852 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 672 transitions. Word has length 62 [2025-03-04 08:02:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:05,853 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 672 transitions. [2025-03-04 08:02:05,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 672 transitions. [2025-03-04 08:02:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 08:02:05,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:05,855 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:05,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 08:02:05,855 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:05,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash -134212119, now seen corresponding path program 1 times [2025-03-04 08:02:05,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:05,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946976505] [2025-03-04 08:02:05,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:05,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 08:02:05,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 08:02:05,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:05,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 08:02:05,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:05,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946976505] [2025-03-04 08:02:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946976505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:05,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:05,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 08:02:05,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860427101] [2025-03-04 08:02:05,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:05,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 08:02:05,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:05,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 08:02:05,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:02:05,918 INFO L87 Difference]: Start difference. First operand 541 states and 672 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:05,949 INFO L93 Difference]: Finished difference Result 537 states and 662 transitions. [2025-03-04 08:02:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 08:02:05,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-04 08:02:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:05,950 INFO L225 Difference]: With dead ends: 537 [2025-03-04 08:02:05,950 INFO L226 Difference]: Without dead ends: 537 [2025-03-04 08:02:05,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 08:02:05,951 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:05,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 148 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-04 08:02:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-03-04 08:02:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 531 states have (on average 1.246704331450094) internal successors, (662), 536 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 662 transitions. [2025-03-04 08:02:05,958 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 662 transitions. Word has length 63 [2025-03-04 08:02:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:05,958 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 662 transitions. [2025-03-04 08:02:05,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 662 transitions. [2025-03-04 08:02:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 08:02:05,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:05,959 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:05,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 08:02:05,959 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:05,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2040029830, now seen corresponding path program 1 times [2025-03-04 08:02:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:05,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038022053] [2025-03-04 08:02:05,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:05,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:05,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 08:02:05,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 08:02:05,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:05,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 08:02:06,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:06,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038022053] [2025-03-04 08:02:06,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038022053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:06,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405328042] [2025-03-04 08:02:06,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:06,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:06,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:06,210 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-03-04 08:02:06,212 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-03-04 08:02:06,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 08:02:06,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 08:02:06,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:06,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:06,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 08:02:06,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:06,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-04 08:02:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 08:02:06,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:06,573 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-04 08:02:06,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2025-03-04 08:02:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 08:02:06,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405328042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:06,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:06,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2025-03-04 08:02:06,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728512451] [2025-03-04 08:02:06,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:06,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 08:02:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:06,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 08:02:06,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2025-03-04 08:02:06,638 INFO L87 Difference]: Start difference. First operand 537 states and 662 transitions. Second operand has 27 states, 27 states have (on average 3.6296296296296298) internal successors, (98), 27 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:07,899 INFO L93 Difference]: Finished difference Result 1248 states and 1579 transitions. [2025-03-04 08:02:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 08:02:07,900 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.6296296296296298) internal successors, (98), 27 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-04 08:02:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:07,903 INFO L225 Difference]: With dead ends: 1248 [2025-03-04 08:02:07,903 INFO L226 Difference]: Without dead ends: 1241 [2025-03-04 08:02:07,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=1549, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 08:02:07,904 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 518 mSDsluCounter, 4219 mSDsCounter, 0 mSdLazyCounter, 3078 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 4463 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:07,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 4463 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3078 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 08:02:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-04 08:02:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 538. [2025-03-04 08:02:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 532 states have (on average 1.2462406015037595) internal successors, (663), 537 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 663 transitions. [2025-03-04 08:02:07,916 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 663 transitions. Word has length 64 [2025-03-04 08:02:07,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:07,916 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 663 transitions. [2025-03-04 08:02:07,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.6296296296296298) internal successors, (98), 27 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 663 transitions. [2025-03-04 08:02:07,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 08:02:07,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:07,917 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:07,924 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-03-04 08:02:08,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:08,118 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:08,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash -82205678, now seen corresponding path program 2 times [2025-03-04 08:02:08,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:08,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305669750] [2025-03-04 08:02:08,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:02:08,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:08,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-04 08:02:08,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 08:02:08,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:02:08,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:08,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305669750] [2025-03-04 08:02:08,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305669750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853187834] [2025-03-04 08:02:08,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:02:08,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:08,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:08,331 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-03-04 08:02:08,332 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-03-04 08:02:08,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-04 08:02:08,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 08:02:08,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:02:08,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:08,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 08:02:08,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:08,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 08:02:08,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 08:02:08,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 08:02:08,530 INFO L378 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-03-04 08:02:08,535 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 08:02:08,535 INFO L378 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-03-04 08:02:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:08,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:09,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853187834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:09,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:09,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2025-03-04 08:02:09,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029572568] [2025-03-04 08:02:09,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:09,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 08:02:09,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:09,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 08:02:09,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2025-03-04 08:02:09,226 INFO L87 Difference]: Start difference. First operand 538 states and 663 transitions. Second operand has 26 states, 25 states have (on average 5.44) internal successors, (136), 26 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:09,715 INFO L93 Difference]: Finished difference Result 1188 states and 1483 transitions. [2025-03-04 08:02:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 08:02:09,715 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.44) internal successors, (136), 26 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-04 08:02:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:09,718 INFO L225 Difference]: With dead ends: 1188 [2025-03-04 08:02:09,718 INFO L226 Difference]: Without dead ends: 1188 [2025-03-04 08:02:09,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-03-04 08:02:09,719 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 533 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:09,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1911 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 08:02:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-03-04 08:02:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1182. [2025-03-04 08:02:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1176 states have (on average 1.2610544217687074) internal successors, (1483), 1181 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1483 transitions. [2025-03-04 08:02:09,732 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1483 transitions. Word has length 67 [2025-03-04 08:02:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:09,733 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1483 transitions. [2025-03-04 08:02:09,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.44) internal successors, (136), 26 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1483 transitions. [2025-03-04 08:02:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 08:02:09,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:09,734 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:09,741 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-03-04 08:02:09,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:09,935 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:09,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:09,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1366809166, now seen corresponding path program 1 times [2025-03-04 08:02:09,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:09,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211575827] [2025-03-04 08:02:09,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:09,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:09,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 08:02:09,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 08:02:09,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:09,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-04 08:02:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:10,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211575827] [2025-03-04 08:02:10,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211575827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:10,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:10,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 08:02:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678826198] [2025-03-04 08:02:10,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:10,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 08:02:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:10,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 08:02:10,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:02:10,010 INFO L87 Difference]: Start difference. First operand 1182 states and 1483 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:10,051 INFO L93 Difference]: Finished difference Result 809 states and 983 transitions. [2025-03-04 08:02:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:02:10,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-04 08:02:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:10,053 INFO L225 Difference]: With dead ends: 809 [2025-03-04 08:02:10,053 INFO L226 Difference]: Without dead ends: 581 [2025-03-04 08:02:10,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:02:10,053 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:10,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 138 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-04 08:02:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 167. [2025-03-04 08:02:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 164 states have (on average 1.1646341463414633) internal successors, (191), 166 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 191 transitions. [2025-03-04 08:02:10,059 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 191 transitions. Word has length 71 [2025-03-04 08:02:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:10,059 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 191 transitions. [2025-03-04 08:02:10,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2025-03-04 08:02:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 08:02:10,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:10,060 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:10,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 08:02:10,060 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:10,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash 749206467, now seen corresponding path program 2 times [2025-03-04 08:02:10,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:10,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026499312] [2025-03-04 08:02:10,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:02:10,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:10,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 08:02:10,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 08:02:10,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:02:10,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 08:02:10,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026499312] [2025-03-04 08:02:10,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026499312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167410783] [2025-03-04 08:02:10,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:02:10,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:10,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:10,264 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-03-04 08:02:10,265 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-03-04 08:02:10,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 08:02:10,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 08:02:10,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:02:10,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:10,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 08:02:10,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-04 08:02:10,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:10,764 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-04 08:02:10,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2025-03-04 08:02:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-04 08:02:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167410783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:10,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:10,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 13] total 33 [2025-03-04 08:02:10,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784106820] [2025-03-04 08:02:10,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:10,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 08:02:10,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:10,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 08:02:10,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 08:02:10,842 INFO L87 Difference]: Start difference. First operand 167 states and 191 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:11,743 INFO L93 Difference]: Finished difference Result 425 states and 505 transitions. [2025-03-04 08:02:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 08:02:11,744 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-04 08:02:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:11,745 INFO L225 Difference]: With dead ends: 425 [2025-03-04 08:02:11,745 INFO L226 Difference]: Without dead ends: 425 [2025-03-04 08:02:11,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 08:02:11,746 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 504 mSDsluCounter, 3867 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 4027 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:11,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 4027 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2698 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 08:02:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-04 08:02:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 191. [2025-03-04 08:02:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 188 states have (on average 1.175531914893617) internal successors, (221), 190 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 221 transitions. [2025-03-04 08:02:11,748 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 221 transitions. Word has length 73 [2025-03-04 08:02:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:11,748 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 221 transitions. [2025-03-04 08:02:11,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 221 transitions. [2025-03-04 08:02:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 08:02:11,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:11,749 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:11,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 08:02:11,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 08:02:11,949 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:11,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1590380671, now seen corresponding path program 1 times [2025-03-04 08:02:11,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:11,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658770616] [2025-03-04 08:02:11,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:11,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 08:02:11,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 08:02:11,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:11,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 08:02:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:11,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658770616] [2025-03-04 08:02:11,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658770616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:11,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 08:02:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278656047] [2025-03-04 08:02:11,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:11,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 08:02:11,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:11,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 08:02:11,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:02:11,986 INFO L87 Difference]: Start difference. First operand 191 states and 221 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:11,995 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2025-03-04 08:02:11,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 08:02:11,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-04 08:02:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:11,996 INFO L225 Difference]: With dead ends: 193 [2025-03-04 08:02:11,996 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 08:02:11,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:02:11,997 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:11,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 08:02:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-04 08:02:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 190 states have (on average 1.1736842105263159) internal successors, (223), 192 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 223 transitions. [2025-03-04 08:02:11,999 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 223 transitions. Word has length 73 [2025-03-04 08:02:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:11,999 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 223 transitions. [2025-03-04 08:02:11,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 223 transitions. [2025-03-04 08:02:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 08:02:11,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:11,999 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:11,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 08:02:11,999 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:12,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:12,000 INFO L85 PathProgramCache]: Analyzing trace with hash -811684929, now seen corresponding path program 1 times [2025-03-04 08:02:12,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:12,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406850668] [2025-03-04 08:02:12,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:12,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 08:02:12,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 08:02:12,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:12,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 08:02:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406850668] [2025-03-04 08:02:12,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406850668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:12,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:12,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 08:02:12,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242427390] [2025-03-04 08:02:12,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:12,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 08:02:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:12,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 08:02:12,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 08:02:12,056 INFO L87 Difference]: Start difference. First operand 193 states and 223 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:12,080 INFO L93 Difference]: Finished difference Result 198 states and 227 transitions. [2025-03-04 08:02:12,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 08:02:12,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-04 08:02:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:12,080 INFO L225 Difference]: With dead ends: 198 [2025-03-04 08:02:12,080 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 08:02:12,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-04 08:02:12,081 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:12,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 156 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:12,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 08:02:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2025-03-04 08:02:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 189 states have (on average 1.1693121693121693) internal successors, (221), 191 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 221 transitions. [2025-03-04 08:02:12,083 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 221 transitions. Word has length 75 [2025-03-04 08:02:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:12,083 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 221 transitions. [2025-03-04 08:02:12,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 221 transitions. [2025-03-04 08:02:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 08:02:12,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:12,084 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:12,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 08:02:12,084 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:12,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1281065408, now seen corresponding path program 1 times [2025-03-04 08:02:12,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:12,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471415860] [2025-03-04 08:02:12,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:12,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:12,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 08:02:12,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 08:02:12,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:12,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:12,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:12,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471415860] [2025-03-04 08:02:12,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471415860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:12,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956896071] [2025-03-04 08:02:12,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:12,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:12,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:12,181 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-03-04 08:02:12,182 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-03-04 08:02:12,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 08:02:12,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 08:02:12,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:12,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:12,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 08:02:12,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:12,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:12,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956896071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:12,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:12,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2025-03-04 08:02:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744622196] [2025-03-04 08:02:12,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:12,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 08:02:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:12,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 08:02:12,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-03-04 08:02:12,487 INFO L87 Difference]: Start difference. First operand 192 states and 221 transitions. Second operand has 19 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 19 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:12,737 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2025-03-04 08:02:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 08:02:12,737 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 19 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-04 08:02:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:12,738 INFO L225 Difference]: With dead ends: 342 [2025-03-04 08:02:12,738 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 08:02:12,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2025-03-04 08:02:12,738 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 131 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:12,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 900 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 08:02:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 08:02:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 239. [2025-03-04 08:02:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 236 states have (on average 1.1567796610169492) internal successors, (273), 238 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 273 transitions. [2025-03-04 08:02:12,741 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 273 transitions. Word has length 77 [2025-03-04 08:02:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:12,741 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 273 transitions. [2025-03-04 08:02:12,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 19 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 273 transitions. [2025-03-04 08:02:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 08:02:12,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:12,741 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:12,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 08:02:12,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:12,942 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:12,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash -393561727, now seen corresponding path program 1 times [2025-03-04 08:02:12,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:12,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813464664] [2025-03-04 08:02:12,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:12,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 08:02:12,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 08:02:12,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:12,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:13,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:13,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813464664] [2025-03-04 08:02:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813464664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:13,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259866965] [2025-03-04 08:02:13,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:13,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:13,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:13,146 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-03-04 08:02:13,148 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-03-04 08:02:13,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 08:02:13,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 08:02:13,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:13,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:13,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 08:02:13,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:13,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 08:02:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:13,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 08:02:13,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259866965] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:13,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-04 08:02:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652791192] [2025-03-04 08:02:13,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:13,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 08:02:13,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:13,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 08:02:13,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-03-04 08:02:13,897 INFO L87 Difference]: Start difference. First operand 239 states and 273 transitions. Second operand has 26 states, 25 states have (on average 6.16) internal successors, (154), 26 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:14,110 INFO L93 Difference]: Finished difference Result 245 states and 278 transitions. [2025-03-04 08:02:14,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 08:02:14,110 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 6.16) internal successors, (154), 26 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-04 08:02:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:14,111 INFO L225 Difference]: With dead ends: 245 [2025-03-04 08:02:14,111 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 08:02:14,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2025-03-04 08:02:14,112 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 87 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:14,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 471 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 08:02:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 08:02:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2025-03-04 08:02:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 215 states have (on average 1.1627906976744187) internal successors, (250), 217 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 250 transitions. [2025-03-04 08:02:14,114 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 250 transitions. Word has length 77 [2025-03-04 08:02:14,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:14,114 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 250 transitions. [2025-03-04 08:02:14,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 6.16) internal successors, (154), 26 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 250 transitions. [2025-03-04 08:02:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 08:02:14,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:14,115 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:14,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 08:02:14,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 08:02:14,315 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:14,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1074745193, now seen corresponding path program 2 times [2025-03-04 08:02:14,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:14,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380639487] [2025-03-04 08:02:14,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:02:14,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:14,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-04 08:02:14,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 08:02:14,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:02:14,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 08:02:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:14,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380639487] [2025-03-04 08:02:14,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380639487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:14,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422941685] [2025-03-04 08:02:14,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:02:14,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:14,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:14,567 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-03-04 08:02:14,569 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-03-04 08:02:14,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-04 08:02:14,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 08:02:14,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:02:14,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:14,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 08:02:14,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 51 proven. 27 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 08:02:14,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:15,123 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-04 08:02:15,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2025-03-04 08:02:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 51 proven. 27 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 08:02:15,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422941685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:15,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:15,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 13] total 34 [2025-03-04 08:02:15,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450571009] [2025-03-04 08:02:15,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:15,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 08:02:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:15,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 08:02:15,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 08:02:15,215 INFO L87 Difference]: Start difference. First operand 218 states and 250 transitions. Second operand has 34 states, 34 states have (on average 3.8823529411764706) internal successors, (132), 34 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:16,059 INFO L93 Difference]: Finished difference Result 381 states and 439 transitions. [2025-03-04 08:02:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 08:02:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.8823529411764706) internal successors, (132), 34 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-04 08:02:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:16,060 INFO L225 Difference]: With dead ends: 381 [2025-03-04 08:02:16,060 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 08:02:16,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1823, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 08:02:16,061 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 276 mSDsluCounter, 3828 mSDsCounter, 0 mSdLazyCounter, 2622 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 4009 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:16,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 4009 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2622 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 08:02:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 08:02:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 182. [2025-03-04 08:02:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 179 states have (on average 1.1620111731843576) internal successors, (208), 181 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2025-03-04 08:02:16,063 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 79 [2025-03-04 08:02:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:16,063 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2025-03-04 08:02:16,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.8823529411764706) internal successors, (132), 34 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2025-03-04 08:02:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 08:02:16,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:16,064 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 08:02:16,072 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-03-04 08:02:16,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 08:02:16,268 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:16,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash -908552183, now seen corresponding path program 2 times [2025-03-04 08:02:16,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:16,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694062755] [2025-03-04 08:02:16,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:02:16,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:16,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-04 08:02:16,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 84 statements. [2025-03-04 08:02:16,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 08:02:16,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-04 08:02:16,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:16,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694062755] [2025-03-04 08:02:16,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694062755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:16,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:16,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 08:02:16,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69153062] [2025-03-04 08:02:16,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:16,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 08:02:16,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:16,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 08:02:16,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 08:02:16,326 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:16,370 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2025-03-04 08:02:16,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 08:02:16,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-04 08:02:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:16,371 INFO L225 Difference]: With dead ends: 181 [2025-03-04 08:02:16,371 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 08:02:16,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:02:16,372 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:16,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 96 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 08:02:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2025-03-04 08:02:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.1180555555555556) internal successors, (161), 145 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2025-03-04 08:02:16,374 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 84 [2025-03-04 08:02:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:16,374 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2025-03-04 08:02:16,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2025-03-04 08:02:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 08:02:16,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:16,375 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:16,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 08:02:16,375 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:16,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1359610408, now seen corresponding path program 3 times [2025-03-04 08:02:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:16,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183493404] [2025-03-04 08:02:16,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 08:02:16,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:16,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 9 equivalence classes. [2025-03-04 08:02:16,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 88 statements. [2025-03-04 08:02:16,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 08:02:16,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-04 08:02:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:16,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183493404] [2025-03-04 08:02:16,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183493404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:16,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954521779] [2025-03-04 08:02:16,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 08:02:16,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:16,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:16,598 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-03-04 08:02:16,600 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-03-04 08:02:16,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 9 equivalence classes. [2025-03-04 08:02:16,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 88 statements. [2025-03-04 08:02:16,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 08:02:16,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:16,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 08:02:16,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:16,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 08:02:16,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 08:02:16,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 08:02:16,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 08:02:16,840 INFO L378 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-03-04 08:02:16,845 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 08:02:16,846 INFO L378 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-03-04 08:02:16,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:02:16,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-03-04 08:02:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-04 08:02:17,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:17,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 08:02:17,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2025-03-04 08:02:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-04 08:02:17,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954521779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:17,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:17,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-03-04 08:02:17,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103007919] [2025-03-04 08:02:17,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:17,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 08:02:17,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:17,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 08:02:17,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-03-04 08:02:17,452 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:17,628 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2025-03-04 08:02:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 08:02:17,629 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-04 08:02:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:17,629 INFO L225 Difference]: With dead ends: 196 [2025-03-04 08:02:17,629 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 08:02:17,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=822, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 08:02:17,630 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 134 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:17,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 85 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:02:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 08:02:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 146. [2025-03-04 08:02:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.1180555555555556) internal successors, (161), 145 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2025-03-04 08:02:17,631 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 88 [2025-03-04 08:02:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:17,632 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2025-03-04 08:02:17,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2025-03-04 08:02:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 08:02:17,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:17,632 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:17,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 08:02:17,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 08:02:17,833 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:17,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash -914567208, now seen corresponding path program 3 times [2025-03-04 08:02:17,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:17,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700608245] [2025-03-04 08:02:17,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 08:02:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:17,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 9 equivalence classes. [2025-03-04 08:02:17,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 90 statements. [2025-03-04 08:02:17,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 08:02:17,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-03-04 08:02:17,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:17,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700608245] [2025-03-04 08:02:17,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700608245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:17,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363768922] [2025-03-04 08:02:17,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 08:02:17,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:17,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:17,987 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-03-04 08:02:17,989 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-03-04 08:02:18,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 9 equivalence classes. [2025-03-04 08:02:18,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 90 statements. [2025-03-04 08:02:18,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 08:02:18,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:18,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 08:02:18,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:18,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 08:02:18,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 08:02:18,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 08:02:18,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 08:02:18,207 INFO L378 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-03-04 08:02:18,213 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 08:02:18,213 INFO L378 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-03-04 08:02:18,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:02:18,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-03-04 08:02:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-03-04 08:02:18,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:18,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 08:02:18,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2025-03-04 08:02:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-03-04 08:02:18,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363768922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:18,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:18,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-04 08:02:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498415552] [2025-03-04 08:02:18,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:18,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 08:02:18,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:18,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 08:02:18,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-04 08:02:18,795 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:18,975 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2025-03-04 08:02:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 08:02:18,975 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-04 08:02:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:18,975 INFO L225 Difference]: With dead ends: 200 [2025-03-04 08:02:18,975 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 08:02:18,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2025-03-04 08:02:18,976 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 99 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:18,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 101 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:02:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 08:02:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 08:02:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2025-03-04 08:02:18,977 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 90 [2025-03-04 08:02:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:18,977 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2025-03-04 08:02:18,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2025-03-04 08:02:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 08:02:18,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:18,977 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:18,985 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-03-04 08:02:19,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:19,179 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 08:02:19,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1880900562, now seen corresponding path program 3 times [2025-03-04 08:02:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:19,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071201643] [2025-03-04 08:02:19,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 08:02:19,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:19,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 10 equivalence classes. [2025-03-04 08:02:19,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 95 statements. [2025-03-04 08:02:19,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 08:02:19,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-04 08:02:19,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:19,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071201643] [2025-03-04 08:02:19,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071201643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:02:19,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202002837] [2025-03-04 08:02:19,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 08:02:19,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:19,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:19,313 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-03-04 08:02:19,315 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-03-04 08:02:19,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 10 equivalence classes. [2025-03-04 08:02:19,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 95 statements. [2025-03-04 08:02:19,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 08:02:19,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:19,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 08:02:19,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:02:19,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 08:02:19,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 08:02:19,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 08:02:19,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 08:02:19,593 INFO L378 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-03-04 08:02:19,599 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 08:02:19,599 INFO L378 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-03-04 08:02:19,829 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2025-03-04 08:02:19,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 14 [2025-03-04 08:02:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-04 08:02:19,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:02:20,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-04 08:02:20,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-03-04 08:02:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-04 08:02:20,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202002837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:02:20,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:02:20,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2025-03-04 08:02:20,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55441829] [2025-03-04 08:02:20,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:02:20,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 08:02:20,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:20,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 08:02:20,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-04 08:02:20,284 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:20,478 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2025-03-04 08:02:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 08:02:20,478 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-04 08:02:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:20,479 INFO L225 Difference]: With dead ends: 95 [2025-03-04 08:02:20,479 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 08:02:20,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2025-03-04 08:02:20,479 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:20,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:02:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 08:02:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 08:02:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 08:02:20,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2025-03-04 08:02:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:20,480 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 08:02:20,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 08:02:20,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (18 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2025-03-04 08:02:20,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2025-03-04 08:02:20,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2025-03-04 08:02:20,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2025-03-04 08:02:20,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 24 remaining) [2025-03-04 08:02:20,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2025-03-04 08:02:20,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2025-03-04 08:02:20,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 24 remaining) [2025-03-04 08:02:20,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 24 remaining) [2025-03-04 08:02:20,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 24 remaining) [2025-03-04 08:02:20,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 08:02:20,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:02:20,686 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 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-03-04 08:02:20,687 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 08:02:20,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 08:02:20 BoogieIcfgContainer [2025-03-04 08:02:20,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 08:02:20,689 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 08:02:20,689 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 08:02:20,689 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 08:02:20,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:01:53" (3/4) ... [2025-03-04 08:02:20,691 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 08:02:20,700 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-04 08:02:20,700 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 08:02:20,700 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 08:02:20,700 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 08:02:20,759 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 08:02:20,759 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 08:02:20,759 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 08:02:20,760 INFO L158 Benchmark]: Toolchain (without parser) took 27475.41ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 104.3MB in the beginning and 142.9MB in the end (delta: -38.6MB). Peak memory consumption was 188.7MB. Max. memory is 16.1GB. [2025-03-04 08:02:20,760 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:02:20,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.97ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 92.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 08:02:20,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.99ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 08:02:20,760 INFO L158 Benchmark]: Boogie Preprocessor took 42.00ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:02:20,760 INFO L158 Benchmark]: IcfgBuilder took 350.26ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 68.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 08:02:20,760 INFO L158 Benchmark]: TraceAbstraction took 26758.35ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 67.6MB in the beginning and 147.1MB in the end (delta: -79.5MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. [2025-03-04 08:02:20,760 INFO L158 Benchmark]: Witness Printer took 69.77ms. Allocated memory is still 369.1MB. Free memory was 147.1MB in the beginning and 142.9MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 08:02:20,762 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.97ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 92.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.99ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.00ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 350.26ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 68.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26758.35ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 67.6MB in the beginning and 147.1MB in the end (delta: -79.5MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. * Witness Printer took 69.77ms. Allocated memory is still 369.1MB. Free memory was 147.1MB in the beginning and 142.9MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 87]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 42, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5498 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5498 mSDsluCounter, 26761 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23487 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16803 IncrementalHoareTripleChecker+Invalid, 16950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 3274 mSDtfsCounter, 16803 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2339 GetRequests, 1803 SyntacticMatches, 12 SemanticMatches, 524 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1182occurred in iteration=31, InterpolantAutomatonStates: 373, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 42 MinimizatonAttempts, 3138 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 3137 NumberOfCodeBlocks, 2640 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 3993 ConstructedInterpolants, 136 QuantifiedInterpolants, 34211 SizeOfPredicates, 86 NumberOfNonLiveVariables, 3826 ConjunctsInSsa, 361 ConjunctsInUnsatCore, 77 InterpolantComputations, 26 PerfectInterpolantSequences, 7739/8880 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 - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 08:02:20,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE