./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b8ae040dd1c04cb353edcaec643cf6ff4fb466fe0a392fe89b90601ffc47007 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:13:50,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:13:50,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:13:50,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:13:50,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:13:50,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:13:50,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:13:50,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:13:50,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:13:50,905 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:13:50,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:13:50,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:13:50,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:13:50,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:13:50,907 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:13:50,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:13:50,907 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:13:50,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:13:50,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:13:50,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:13:50,907 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:13:50,907 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:13:50,907 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:13:50,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:13:50,908 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:13:50,908 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:13:50,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:13:50,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:13:50,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:13:50,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:13:50,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:13:50,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:50,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:50,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:13:50,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:13:50,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:13:50,910 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 -> 8b8ae040dd1c04cb353edcaec643cf6ff4fb466fe0a392fe89b90601ffc47007 [2025-04-29 11:13:51,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:13:51,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:13:51,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:13:51,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:13:51,127 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:13:51,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca-2.c [2025-04-29 11:13:52,401 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117cb255c/a9fbdb1e2dac462ba9a824ad26bbb93f/FLAG9795ead9f [2025-04-29 11:13:52,569 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:13:52,570 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca-2.c [2025-04-29 11:13:52,571 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:13:52,585 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117cb255c/a9fbdb1e2dac462ba9a824ad26bbb93f/FLAG9795ead9f [2025-04-29 11:13:53,602 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117cb255c/a9fbdb1e2dac462ba9a824ad26bbb93f [2025-04-29 11:13:53,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:13:53,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:13:53,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:13:53,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:13:53,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:13:53,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2c3c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53, skipping insertion in model container [2025-04-29 11:13:53,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:13:53,743 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:13:53,753 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:13:53,754 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:13:53,760 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:13:53,780 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:13:53,794 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:13:53,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53 WrapperNode [2025-04-29 11:13:53,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:13:53,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:13:53,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:13:53,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:13:53,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,819 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-04-29 11:13:53,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:13:53,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:13:53,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:13:53,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:13:53,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,836 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-04-29 11:13:53,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:13:53,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:13:53,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:13:53,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:13:53,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (1/1) ... [2025-04-29 11:13:53,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:13:53,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:53,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:13:53,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:13:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:13:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:13:53,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:13:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:13:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:13:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:13:53,965 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:13:53,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:13:54,123 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-04-29 11:13:54,123 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:13:54,131 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:13:54,131 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:13:54,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:13:54 BoogieIcfgContainer [2025-04-29 11:13:54,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:13:54,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:13:54,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:13:54,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:13:54,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:13:53" (1/3) ... [2025-04-29 11:13:54,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c36920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:13:54, skipping insertion in model container [2025-04-29 11:13:54,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:13:53" (2/3) ... [2025-04-29 11:13:54,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c36920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:13:54, skipping insertion in model container [2025-04-29 11:13:54,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:13:54" (3/3) ... [2025-04-29 11:13:54,141 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cmemchr-alloca-2.c [2025-04-29 11:13:54,151 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:13:54,153 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cmemchr-alloca-2.c that has 1 procedures, 24 locations, 30 edges, 1 initial locations, 2 loop locations, and 5 error locations. [2025-04-29 11:13:54,185 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:13:54,193 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@757c481d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:13:54,194 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-29 11:13:54,196 INFO L278 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 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-04-29 11:13:54,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:54,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:54,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:54,202 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:54,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:54,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-29 11:13:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:54,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677512029] [2025-04-29 11:13:54,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:54,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:54,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:54,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:54,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:54,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:54,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:54,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677512029] [2025-04-29 11:13:54,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677512029] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:54,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:54,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:54,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528985765] [2025-04-29 11:13:54,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:54,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:54,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:54,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:54,594 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:54,661 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2025-04-29 11:13:54,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:54,662 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:13:54,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:54,667 INFO L225 Difference]: With dead ends: 28 [2025-04-29 11:13:54,667 INFO L226 Difference]: Without dead ends: 26 [2025-04-29 11:13:54,668 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:54,670 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:54,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 71 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-29 11:13:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2025-04-29 11:13:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 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-04-29 11:13:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-04-29 11:13:54,693 INFO L79 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 7 [2025-04-29 11:13:54,693 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:54,693 INFO L485 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-04-29 11:13:54,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:54,694 INFO L278 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-04-29 11:13:54,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:54,694 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:54,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:54,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:13:54,695 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:54,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028969, now seen corresponding path program 1 times [2025-04-29 11:13:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:54,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92020315] [2025-04-29 11:13:54,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:54,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:54,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:54,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:54,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:54,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:54,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:54,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92020315] [2025-04-29 11:13:54,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92020315] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:54,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:54,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:54,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842363577] [2025-04-29 11:13:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:54,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:54,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:54,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:54,858 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:54,918 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2025-04-29 11:13:54,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:54,919 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:13:54,919 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:54,919 INFO L225 Difference]: With dead ends: 29 [2025-04-29 11:13:54,919 INFO L226 Difference]: Without dead ends: 29 [2025-04-29 11:13:54,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:54,920 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:54,920 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-29 11:13:54,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2025-04-29 11:13:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.45) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-04-29 11:13:54,922 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 7 [2025-04-29 11:13:54,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:54,922 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-04-29 11:13:54,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:54,923 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-04-29 11:13:54,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:13:54,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:54,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:54,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:13:54,923 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:54,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088551, now seen corresponding path program 1 times [2025-04-29 11:13:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:54,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48413831] [2025-04-29 11:13:54,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:54,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:54,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:13:54,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:13:54,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:54,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:55,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48413831] [2025-04-29 11:13:55,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48413831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:55,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:55,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:55,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790043283] [2025-04-29 11:13:55,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:55,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:55,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:55,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:55,072 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-04-29 11:13:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:55,117 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-04-29 11:13:55,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:55,117 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:13:55,118 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:55,118 INFO L225 Difference]: With dead ends: 27 [2025-04-29 11:13:55,118 INFO L226 Difference]: Without dead ends: 27 [2025-04-29 11:13:55,118 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:55,119 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:55,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 81 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-29 11:13:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-04-29 11:13:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 22 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-04-29 11:13:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-04-29 11:13:55,121 INFO L79 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 7 [2025-04-29 11:13:55,121 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:55,121 INFO L485 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-04-29 11:13:55,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-04-29 11:13:55,121 INFO L278 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-04-29 11:13:55,121 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:13:55,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:55,122 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:55,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:13:55,122 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:55,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash 627432691, now seen corresponding path program 1 times [2025-04-29 11:13:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:55,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123564847] [2025-04-29 11:13:55,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:55,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:13:55,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:13:55,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:55,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:55,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:55,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123564847] [2025-04-29 11:13:55,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123564847] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:55,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509505884] [2025-04-29 11:13:55,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:55,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:55,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:55,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:55,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:13:55,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:13:55,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:13:55,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:55,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:55,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:13:55,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:55,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:13:55,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509505884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:55,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:13:55,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:13:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795554375] [2025-04-29 11:13:55,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:55,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:55,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:55,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:55,248 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-04-29 11:13:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:55,275 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-04-29 11:13:55,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:55,275 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-04-29 11:13:55,276 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:55,276 INFO L225 Difference]: With dead ends: 28 [2025-04-29 11:13:55,276 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 11:13:55,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:55,277 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:55,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 11:13:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-29 11:13:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.375) internal successors, (33), 27 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-04-29 11:13:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-04-29 11:13:55,279 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 10 [2025-04-29 11:13:55,279 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:55,279 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-04-29 11:13:55,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-04-29 11:13:55,279 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-04-29 11:13:55,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:13:55,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:55,280 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:55,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:55,484 WARN L466 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-04-29 11:13:55,484 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:55,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1892527243, now seen corresponding path program 1 times [2025-04-29 11:13:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:55,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292606019] [2025-04-29 11:13:55,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:55,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:55,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:13:55,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:13:55,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:55,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:55,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:55,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292606019] [2025-04-29 11:13:55,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292606019] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:55,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880048414] [2025-04-29 11:13:55,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:55,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:55,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:55,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:55,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:13:55,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:13:55,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:13:55,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:55,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:55,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:13:55,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:55,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 11:13:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:55,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880048414] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:56,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:56,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-29 11:13:56,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418850547] [2025-04-29 11:13:56,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:56,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:13:56,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:56,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:13:56,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:13:56,100 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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-04-29 11:13:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:56,196 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-04-29 11:13:56,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:13:56,196 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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 10 [2025-04-29 11:13:56,196 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:56,197 INFO L225 Difference]: With dead ends: 28 [2025-04-29 11:13:56,197 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 11:13:56,197 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:13:56,198 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:56,198 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:56,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 11:13:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-04-29 11:13:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 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-04-29 11:13:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-04-29 11:13:56,200 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 10 [2025-04-29 11:13:56,200 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:56,200 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-04-29 11:13:56,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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-04-29 11:13:56,200 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-04-29 11:13:56,200 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:13:56,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:56,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:56,206 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-04-29 11:13:56,405 WARN L466 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-04-29 11:13:56,405 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:56,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1667580149, now seen corresponding path program 1 times [2025-04-29 11:13:56,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:56,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567746412] [2025-04-29 11:13:56,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:56,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:56,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:13:56,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:13:56,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:56,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:56,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:56,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567746412] [2025-04-29 11:13:56,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567746412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:56,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:56,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:56,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116710235] [2025-04-29 11:13:56,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:56,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:13:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:56,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:13:56,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:13:56,470 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-04-29 11:13:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:56,507 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-04-29 11:13:56,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:13:56,507 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-04-29 11:13:56,507 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:56,507 INFO L225 Difference]: With dead ends: 27 [2025-04-29 11:13:56,508 INFO L226 Difference]: Without dead ends: 27 [2025-04-29 11:13:56,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:13:56,508 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:56,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-29 11:13:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-04-29 11:13:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 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-04-29 11:13:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-04-29 11:13:56,510 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 12 [2025-04-29 11:13:56,510 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:56,510 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-04-29 11:13:56,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-04-29 11:13:56,511 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-04-29 11:13:56,511 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:13:56,511 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:56,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:56,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:13:56,511 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:56,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1667580150, now seen corresponding path program 1 times [2025-04-29 11:13:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:56,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472391099] [2025-04-29 11:13:56,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:56,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:13:56,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:13:56,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:56,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:56,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:56,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472391099] [2025-04-29 11:13:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472391099] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:56,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874352964] [2025-04-29 11:13:56,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:56,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:56,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:56,657 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:56,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:13:56,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:13:56,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:13:56,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:56,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:56,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:13:56,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:56,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:56,819 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-04-29 11:13:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:56,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874352964] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:56,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:56,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-04-29 11:13:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711848963] [2025-04-29 11:13:56,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:56,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:13:56,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:56,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:13:56,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:13:56,834 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 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-04-29 11:13:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:56,912 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-04-29 11:13:56,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:13:56,913 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 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 12 [2025-04-29 11:13:56,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:56,914 INFO L225 Difference]: With dead ends: 31 [2025-04-29 11:13:56,914 INFO L226 Difference]: Without dead ends: 31 [2025-04-29 11:13:56,914 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:13:56,915 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:56,917 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 120 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-29 11:13:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-04-29 11:13:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.28) internal successors, (32), 26 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-04-29 11:13:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-04-29 11:13:56,920 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 12 [2025-04-29 11:13:56,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:56,920 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-04-29 11:13:56,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 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-04-29 11:13:56,921 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-04-29 11:13:56,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:13:56,921 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:56,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:56,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:57,121 WARN L466 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-04-29 11:13:57,121 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:57,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash 156113933, now seen corresponding path program 1 times [2025-04-29 11:13:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:57,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055386024] [2025-04-29 11:13:57,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:57,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:57,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:13:57,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:13:57,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:57,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:57,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:57,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055386024] [2025-04-29 11:13:57,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055386024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:57,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:57,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:13:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039605890] [2025-04-29 11:13:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:57,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:57,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:57,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:57,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:57,181 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-04-29 11:13:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:57,200 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-04-29 11:13:57,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:57,201 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:13:57,201 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:57,201 INFO L225 Difference]: With dead ends: 32 [2025-04-29 11:13:57,201 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 11:13:57,201 INFO L436 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-04-29 11:13:57,201 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:57,201 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 11:13:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-04-29 11:13:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 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-04-29 11:13:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-04-29 11:13:57,205 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 13 [2025-04-29 11:13:57,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:57,205 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-04-29 11:13:57,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-04-29 11:13:57,205 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-04-29 11:13:57,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:13:57,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:57,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:57,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:13:57,207 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:57,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -236913077, now seen corresponding path program 1 times [2025-04-29 11:13:57,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:57,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43505309] [2025-04-29 11:13:57,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:57,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:57,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:13:57,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:13:57,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:57,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:57,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43505309] [2025-04-29 11:13:57,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43505309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:57,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026706176] [2025-04-29 11:13:57,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:57,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:57,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:57,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:57,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:57,262 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:57,278 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-04-29 11:13:57,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:57,280 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:13:57,280 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:57,280 INFO L225 Difference]: With dead ends: 30 [2025-04-29 11:13:57,280 INFO L226 Difference]: Without dead ends: 30 [2025-04-29 11:13:57,280 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:57,280 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:57,280 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-29 11:13:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-04-29 11:13:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 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-04-29 11:13:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-04-29 11:13:57,282 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2025-04-29 11:13:57,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:57,282 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-04-29 11:13:57,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:57,282 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-04-29 11:13:57,282 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:13:57,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:57,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:57,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:13:57,283 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:57,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1006485452, now seen corresponding path program 1 times [2025-04-29 11:13:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:57,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274480406] [2025-04-29 11:13:57,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:57,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:13:57,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:13:57,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:57,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:57,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:57,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274480406] [2025-04-29 11:13:57,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274480406] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:57,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:57,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:13:57,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229928613] [2025-04-29 11:13:57,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:57,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:13:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:57,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:13:57,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:13:57,353 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-04-29 11:13:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:57,366 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-04-29 11:13:57,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:13:57,366 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-04-29 11:13:57,366 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:57,366 INFO L225 Difference]: With dead ends: 26 [2025-04-29 11:13:57,366 INFO L226 Difference]: Without dead ends: 22 [2025-04-29 11:13:57,367 INFO L436 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-04-29 11:13:57,367 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:57,367 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-29 11:13:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-29 11:13:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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-04-29 11:13:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-04-29 11:13:57,368 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2025-04-29 11:13:57,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:57,369 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-04-29 11:13:57,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-04-29 11:13:57,369 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-04-29 11:13:57,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:13:57,370 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:57,370 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:57,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:13:57,370 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:57,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1136231622, now seen corresponding path program 1 times [2025-04-29 11:13:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:57,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618506861] [2025-04-29 11:13:57,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:57,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:57,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:13:57,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:13:57,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:57,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:13:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:57,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618506861] [2025-04-29 11:13:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618506861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:13:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:13:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:13:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003616692] [2025-04-29 11:13:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:13:57,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:13:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:57,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:13:57,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:57,436 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-04-29 11:13:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:57,454 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-04-29 11:13:57,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:13:57,455 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-04-29 11:13:57,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:57,455 INFO L225 Difference]: With dead ends: 27 [2025-04-29 11:13:57,455 INFO L226 Difference]: Without dead ends: 17 [2025-04-29 11:13:57,455 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:13:57,456 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:57,456 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-04-29 11:13:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-04-29 11:13:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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-04-29 11:13:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-04-29 11:13:57,457 INFO L79 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2025-04-29 11:13:57,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:57,457 INFO L485 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-04-29 11:13:57,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-04-29 11:13:57,458 INFO L278 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-04-29 11:13:57,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:13:57,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:57,458 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:57,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:13:57,458 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:57,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1723037636, now seen corresponding path program 1 times [2025-04-29 11:13:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:57,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854827513] [2025-04-29 11:13:57,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:57,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:13:57,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:13:57,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:57,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:57,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:57,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854827513] [2025-04-29 11:13:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854827513] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:57,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543944599] [2025-04-29 11:13:57,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:13:57,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:57,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:57,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:57,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:13:57,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:13:57,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:13:57,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:13:57,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:57,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:13:57,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:57,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:57,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543944599] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:57,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:57,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-29 11:13:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516353368] [2025-04-29 11:13:57,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:57,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:13:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:57,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:13:57,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:13:57,735 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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-04-29 11:13:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:57,779 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-04-29 11:13:57,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:13:57,779 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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 16 [2025-04-29 11:13:57,779 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:57,780 INFO L225 Difference]: With dead ends: 27 [2025-04-29 11:13:57,780 INFO L226 Difference]: Without dead ends: 22 [2025-04-29 11:13:57,780 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:13:57,780 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:57,780 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 56 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:13:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-29 11:13:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-04-29 11:13:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 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-04-29 11:13:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-04-29 11:13:57,782 INFO L79 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2025-04-29 11:13:57,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:57,782 INFO L485 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-04-29 11:13:57,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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-04-29 11:13:57,782 INFO L278 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-04-29 11:13:57,783 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:13:57,783 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:57,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:57,789 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-04-29 11:13:57,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:57,987 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:57,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1854514094, now seen corresponding path program 2 times [2025-04-29 11:13:57,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:57,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852796853] [2025-04-29 11:13:57,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:57,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-29 11:13:57,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:13:58,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:58,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:58,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:58,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852796853] [2025-04-29 11:13:58,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852796853] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:58,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974878553] [2025-04-29 11:13:58,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:13:58,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:58,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:58,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:58,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:13:58,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-29 11:13:58,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:13:58,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:13:58,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:58,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:13:58,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:58,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:58,484 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:13:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:58,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974878553] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:58,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:58,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-29 11:13:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742377740] [2025-04-29 11:13:58,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:58,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:13:58,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:58,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:13:58,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:13:58,510 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 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-04-29 11:13:58,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:58,642 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-04-29 11:13:58,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:13:58,643 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:13:58,643 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:58,643 INFO L225 Difference]: With dead ends: 25 [2025-04-29 11:13:58,643 INFO L226 Difference]: Without dead ends: 25 [2025-04-29 11:13:58,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:13:58,644 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:58,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-04-29 11:13:58,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-04-29 11:13:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 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-04-29 11:13:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-04-29 11:13:58,646 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2025-04-29 11:13:58,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:58,646 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-04-29 11:13:58,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 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-04-29 11:13:58,646 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-04-29 11:13:58,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:13:58,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:58,647 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:58,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:13:58,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 11:13:58,848 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:58,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:58,848 INFO L85 PathProgramCache]: Analyzing trace with hash 76202482, now seen corresponding path program 3 times [2025-04-29 11:13:58,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:58,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427514047] [2025-04-29 11:13:58,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:58,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:58,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-04-29 11:13:58,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:13:58,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:13:58,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:58,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427514047] [2025-04-29 11:13:58,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427514047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:58,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586718234] [2025-04-29 11:13:58,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:13:58,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:58,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:58,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:58,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:13:59,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-04-29 11:13:59,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:13:59,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:13:59,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:59,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:13:59,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:59,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:13:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:59,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586718234] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:13:59,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:13:59,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-04-29 11:13:59,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930851367] [2025-04-29 11:13:59,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:13:59,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:13:59,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:13:59,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:13:59,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:13:59,233 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 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-04-29 11:13:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:13:59,315 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2025-04-29 11:13:59,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:13:59,316 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 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 23 [2025-04-29 11:13:59,316 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:13:59,316 INFO L225 Difference]: With dead ends: 38 [2025-04-29 11:13:59,316 INFO L226 Difference]: Without dead ends: 29 [2025-04-29 11:13:59,316 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:13:59,317 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:13:59,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 124 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:13:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-29 11:13:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-04-29 11:13:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:13:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-04-29 11:13:59,318 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2025-04-29 11:13:59,318 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:13:59,318 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-04-29 11:13:59,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 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-04-29 11:13:59,318 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-04-29 11:13:59,319 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:13:59,319 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:13:59,319 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:13:59,325 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-04-29 11:13:59,523 WARN L466 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-04-29 11:13:59,523 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:13:59,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:13:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1118782016, now seen corresponding path program 4 times [2025-04-29 11:13:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:13:59,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345880362] [2025-04-29 11:13:59,524 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:13:59,530 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-29 11:13:59,537 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:13:59,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:13:59,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:59,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:13:59,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345880362] [2025-04-29 11:13:59,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345880362] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:13:59,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291674963] [2025-04-29 11:13:59,744 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:13:59,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:13:59,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:13:59,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:13:59,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:13:59,780 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-29 11:13:59,796 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:13:59,797 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:13:59,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:13:59,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-29 11:13:59,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:13:59,806 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:13:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:13:59,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:00,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291674963] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:00,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:00,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2025-04-29 11:14:00,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054200169] [2025-04-29 11:14:00,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:00,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:14:00,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:00,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:14:00,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:14:00,196 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:00,357 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-04-29 11:14:00,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:14:00,358 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:14:00,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:00,358 INFO L225 Difference]: With dead ends: 32 [2025-04-29 11:14:00,358 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 11:14:00,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:14:00,359 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:00,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 143 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 11:14:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-04-29 11:14:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 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-04-29 11:14:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-04-29 11:14:00,361 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2025-04-29 11:14:00,361 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:00,361 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-04-29 11:14:00,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:00,361 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-04-29 11:14:00,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:14:00,361 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:00,361 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:00,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:14:00,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:00,566 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:00,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:00,566 INFO L85 PathProgramCache]: Analyzing trace with hash -121976956, now seen corresponding path program 5 times [2025-04-29 11:14:00,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:00,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959563120] [2025-04-29 11:14:00,566 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:14:00,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:00,571 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-29 11:14:00,583 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:14:00,583 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-29 11:14:00,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:00,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:00,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959563120] [2025-04-29 11:14:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959563120] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:00,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309936036] [2025-04-29 11:14:00,710 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:14:00,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:00,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:00,712 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:00,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:14:00,744 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-29 11:14:00,770 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:14:00,770 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-29 11:14:00,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:00,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:14:00,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:00,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:00,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309936036] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:00,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:00,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-04-29 11:14:00,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936257045] [2025-04-29 11:14:00,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:00,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:14:00,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:00,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:14:00,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:14:00,984 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 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-04-29 11:14:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:01,111 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-04-29 11:14:01,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:14:01,111 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 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 30 [2025-04-29 11:14:01,111 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:01,112 INFO L225 Difference]: With dead ends: 49 [2025-04-29 11:14:01,112 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 11:14:01,112 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:14:01,112 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:01,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 208 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 11:14:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-04-29 11:14:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2025-04-29 11:14:01,114 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 30 [2025-04-29 11:14:01,114 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:01,114 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2025-04-29 11:14:01,114 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 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-04-29 11:14:01,114 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2025-04-29 11:14:01,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:14:01,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:01,114 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:01,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:01,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:14:01,319 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:01,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2027818122, now seen corresponding path program 6 times [2025-04-29 11:14:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:01,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928431319] [2025-04-29 11:14:01,320 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:14:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:01,324 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 5 equivalence classes. [2025-04-29 11:14:01,338 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:14:01,339 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-29 11:14:01,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:01,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:01,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928431319] [2025-04-29 11:14:01,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928431319] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:01,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085734908] [2025-04-29 11:14:01,767 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:14:01,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:01,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:01,769 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:01,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:14:01,804 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 5 equivalence classes. [2025-04-29 11:14:01,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:14:01,825 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-29 11:14:01,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:01,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-29 11:14:01,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:01,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:14:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:02,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:02,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085734908] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:02,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:02,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 40 [2025-04-29 11:14:02,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205668116] [2025-04-29 11:14:02,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:02,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 11:14:02,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:02,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 11:14:02,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2025-04-29 11:14:02,394 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 41 states, 40 states have (on average 2.35) internal successors, (94), 41 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-04-29 11:14:02,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:02,748 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2025-04-29 11:14:02,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:14:02,748 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.35) internal successors, (94), 41 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) Word has length 33 [2025-04-29 11:14:02,749 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:02,749 INFO L225 Difference]: With dead ends: 38 [2025-04-29 11:14:02,749 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 11:14:02,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=1970, Unknown=0, NotChecked=0, Total=2256 [2025-04-29 11:14:02,751 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:02,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 151 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:14:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 11:14:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-29 11:14:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 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-04-29 11:14:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-04-29 11:14:02,755 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2025-04-29 11:14:02,755 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:02,757 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-04-29 11:14:02,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.35) internal successors, (94), 41 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-04-29 11:14:02,757 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-04-29 11:14:02,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:14:02,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:02,757 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:02,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:02,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:14:02,958 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:02,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1969614266, now seen corresponding path program 7 times [2025-04-29 11:14:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:02,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418961750] [2025-04-29 11:14:02,958 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:14:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:02,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:14:02,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:14:02,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:02,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:03,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:03,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418961750] [2025-04-29 11:14:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418961750] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:03,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587935713] [2025-04-29 11:14:03,110 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:14:03,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:03,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:03,111 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:03,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:14:03,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:14:03,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:14:03,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:03,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:03,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:14:03,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:03,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:03,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587935713] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:03,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:03,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2025-04-29 11:14:03,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782105574] [2025-04-29 11:14:03,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:03,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 11:14:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:03,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 11:14:03,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:14:03,418 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 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-04-29 11:14:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:03,584 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2025-04-29 11:14:03,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:14:03,584 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 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 37 [2025-04-29 11:14:03,585 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:03,585 INFO L225 Difference]: With dead ends: 60 [2025-04-29 11:14:03,585 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:14:03,585 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:14:03,585 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:03,585 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 302 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:14:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-04-29 11:14:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2025-04-29 11:14:03,587 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2025-04-29 11:14:03,587 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:03,587 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2025-04-29 11:14:03,587 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 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-04-29 11:14:03,587 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2025-04-29 11:14:03,588 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:14:03,588 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:03,588 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:03,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:14:03,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 11:14:03,788 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:03,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash 981781896, now seen corresponding path program 8 times [2025-04-29 11:14:03,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:03,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978281703] [2025-04-29 11:14:03,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:14:03,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:03,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 11:14:03,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:14:03,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:14:03,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 15 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:04,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:04,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978281703] [2025-04-29 11:14:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978281703] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:04,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576548880] [2025-04-29 11:14:04,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:14:04,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:04,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:04,120 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:04,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:14:04,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 11:14:04,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:14:04,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:14:04,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:04,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-29 11:14:04,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:04,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:04,568 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:14:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 26 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576548880] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:04,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2025-04-29 11:14:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090168787] [2025-04-29 11:14:04,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:04,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-29 11:14:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:04,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-29 11:14:04,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 11:14:04,690 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 38 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 38 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-04-29 11:14:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:04,938 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2025-04-29 11:14:04,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:14:04,939 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 38 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 40 [2025-04-29 11:14:04,939 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:04,939 INFO L225 Difference]: With dead ends: 46 [2025-04-29 11:14:04,939 INFO L226 Difference]: Without dead ends: 46 [2025-04-29 11:14:04,939 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=1580, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:14:04,940 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:04,940 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 196 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:14:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-29 11:14:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-04-29 11:14:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 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-04-29 11:14:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-04-29 11:14:04,941 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 40 [2025-04-29 11:14:04,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:04,942 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-04-29 11:14:04,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 38 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-04-29 11:14:04,942 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-04-29 11:14:04,942 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:14:04,942 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:04,942 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:04,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 11:14:05,142 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:05,143 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:05,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1463193908, now seen corresponding path program 9 times [2025-04-29 11:14:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:05,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249808510] [2025-04-29 11:14:05,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:14:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:05,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 6 equivalence classes. [2025-04-29 11:14:05,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:14:05,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-29 11:14:05,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:05,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:05,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249808510] [2025-04-29 11:14:05,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249808510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:05,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854793451] [2025-04-29 11:14:05,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:14:05,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:05,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:05,528 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:05,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:14:05,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 6 equivalence classes. [2025-04-29 11:14:05,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:14:05,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-29 11:14:05,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:05,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:14:05,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:05,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:06,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854793451] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:06,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:06,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 37 [2025-04-29 11:14:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307947086] [2025-04-29 11:14:06,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:06,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-29 11:14:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:06,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-29 11:14:06,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2025-04-29 11:14:06,048 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 0 states have call successors, (0), 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-04-29 11:14:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:06,548 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2025-04-29 11:14:06,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:14:06,548 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 0 states have call successors, (0), 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-04-29 11:14:06,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:06,549 INFO L225 Difference]: With dead ends: 71 [2025-04-29 11:14:06,549 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 11:14:06,549 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=2148, Unknown=0, NotChecked=0, Total=2352 [2025-04-29 11:14:06,550 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:06,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 462 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:14:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 11:14:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-04-29 11:14:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-04-29 11:14:06,551 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 44 [2025-04-29 11:14:06,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:06,551 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-04-29 11:14:06,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 0 states have call successors, (0), 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-04-29 11:14:06,551 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-04-29 11:14:06,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:14:06,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:06,552 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:06,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:06,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:06,756 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:06,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1127467838, now seen corresponding path program 10 times [2025-04-29 11:14:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:06,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933059511] [2025-04-29 11:14:06,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:14:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:06,762 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-29 11:14:06,774 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:14:06,774 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:14:06,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:07,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933059511] [2025-04-29 11:14:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933059511] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:07,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004350083] [2025-04-29 11:14:07,084 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:14:07,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:07,086 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:07,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:14:07,142 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-29 11:14:07,168 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:14:07,168 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:14:07,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:07,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-04-29 11:14:07,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:07,175 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:14:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:07,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 51 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004350083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:07,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:07,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 42 [2025-04-29 11:14:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378791096] [2025-04-29 11:14:07,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:07,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 11:14:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:07,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 11:14:07,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1589, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:14:07,790 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 43 states, 42 states have (on average 2.738095238095238) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 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-04-29 11:14:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:08,074 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2025-04-29 11:14:08,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:14:08,074 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.738095238095238) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 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 47 [2025-04-29 11:14:08,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:08,074 INFO L225 Difference]: With dead ends: 53 [2025-04-29 11:14:08,074 INFO L226 Difference]: Without dead ends: 53 [2025-04-29 11:14:08,075 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=2075, Unknown=0, NotChecked=0, Total=2352 [2025-04-29 11:14:08,075 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:08,076 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 302 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:14:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-29 11:14:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-04-29 11:14:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-04-29 11:14:08,077 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2025-04-29 11:14:08,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:08,077 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-04-29 11:14:08,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.738095238095238) internal successors, (115), 43 states have internal predecessors, (115), 0 states have call successors, (0), 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-04-29 11:14:08,077 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-04-29 11:14:08,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:14:08,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:08,078 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:08,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:08,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-29 11:14:08,279 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:08,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:08,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1581866622, now seen corresponding path program 11 times [2025-04-29 11:14:08,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:08,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331400583] [2025-04-29 11:14:08,279 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:14:08,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:08,284 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 7 equivalence classes. [2025-04-29 11:14:08,303 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:14:08,306 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-29 11:14:08,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:08,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331400583] [2025-04-29 11:14:08,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331400583] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:08,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483659784] [2025-04-29 11:14:08,563 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:14:08,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:08,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:08,565 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:08,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:14:08,614 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 7 equivalence classes. [2025-04-29 11:14:08,655 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:14:08,655 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-29 11:14:08,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:08,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:14:08,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:08,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483659784] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:09,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:09,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-04-29 11:14:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345391244] [2025-04-29 11:14:09,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:09,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:14:09,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:09,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:14:09,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1031, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 11:14:09,028 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 34 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 states have internal predecessors, (101), 0 states have call successors, (0), 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-04-29 11:14:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:09,289 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2025-04-29 11:14:09,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:14:09,291 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 states have internal predecessors, (101), 0 states have call successors, (0), 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-04-29 11:14:09,291 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:09,291 INFO L225 Difference]: With dead ends: 82 [2025-04-29 11:14:09,291 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 11:14:09,292 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=1366, Unknown=0, NotChecked=0, Total=1482 [2025-04-29 11:14:09,293 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:09,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 495 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:14:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 11:14:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-04-29 11:14:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2025-04-29 11:14:09,294 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 51 [2025-04-29 11:14:09,295 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:09,295 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2025-04-29 11:14:09,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 states have internal predecessors, (101), 0 states have call successors, (0), 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-04-29 11:14:09,295 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2025-04-29 11:14:09,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:14:09,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:09,295 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:09,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:14:09,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:09,496 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:09,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1972191024, now seen corresponding path program 12 times [2025-04-29 11:14:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:09,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698515062] [2025-04-29 11:14:09,496 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:14:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:09,501 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 8 equivalence classes. [2025-04-29 11:14:09,527 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:14:09,527 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-29 11:14:09,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 40 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:10,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:10,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698515062] [2025-04-29 11:14:10,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698515062] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:10,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236614362] [2025-04-29 11:14:10,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:14:10,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:10,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:10,036 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:10,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:14:10,080 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 8 equivalence classes. [2025-04-29 11:14:10,125 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:14:10,125 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-29 11:14:10,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:10,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-29 11:14:10,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 57 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:10,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:10,652 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:14:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 57 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:10,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236614362] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:10,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:10,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 45 [2025-04-29 11:14:10,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767050032] [2025-04-29 11:14:10,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:10,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-29 11:14:10,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:10,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-29 11:14:10,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1806, Unknown=0, NotChecked=0, Total=2070 [2025-04-29 11:14:10,749 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 46 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 46 states have internal predecessors, (118), 0 states have call successors, (0), 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-04-29 11:14:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:11,087 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2025-04-29 11:14:11,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 11:14:11,088 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 46 states have internal predecessors, (118), 0 states have call successors, (0), 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 54 [2025-04-29 11:14:11,088 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:11,088 INFO L225 Difference]: With dead ends: 60 [2025-04-29 11:14:11,088 INFO L226 Difference]: Without dead ends: 60 [2025-04-29 11:14:11,089 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=467, Invalid=2839, Unknown=0, NotChecked=0, Total=3306 [2025-04-29 11:14:11,089 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:11,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:14:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-29 11:14:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2025-04-29 11:14:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 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-04-29 11:14:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2025-04-29 11:14:11,091 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 54 [2025-04-29 11:14:11,091 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:11,091 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2025-04-29 11:14:11,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 46 states have internal predecessors, (118), 0 states have call successors, (0), 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-04-29 11:14:11,091 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2025-04-29 11:14:11,091 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-29 11:14:11,091 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:11,092 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:11,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-29 11:14:11,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:11,296 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:11,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:11,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1636008428, now seen corresponding path program 13 times [2025-04-29 11:14:11,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:11,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463409469] [2025-04-29 11:14:11,296 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:14:11,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:11,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:14:11,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:14:11,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:11,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 14 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:11,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463409469] [2025-04-29 11:14:11,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463409469] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:11,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488564427] [2025-04-29 11:14:11,530 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:14:11,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:11,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:11,532 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:11,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:14:11,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:14:11,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:14:11,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:11,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:11,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-29 11:14:11,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 14 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:11,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 14 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488564427] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:12,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2025-04-29 11:14:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614289229] [2025-04-29 11:14:12,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:12,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-29 11:14:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:12,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-29 11:14:12,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 11:14:12,045 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 38 states, 38 states have (on average 3.026315789473684) internal successors, (115), 38 states have internal predecessors, (115), 0 states have call successors, (0), 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-04-29 11:14:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:12,398 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2025-04-29 11:14:12,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 11:14:12,399 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.026315789473684) internal successors, (115), 38 states have internal predecessors, (115), 0 states have call successors, (0), 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-04-29 11:14:12,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:12,399 INFO L225 Difference]: With dead ends: 93 [2025-04-29 11:14:12,399 INFO L226 Difference]: Without dead ends: 64 [2025-04-29 11:14:12,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=1761, Unknown=0, NotChecked=0, Total=1892 [2025-04-29 11:14:12,400 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:12,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 635 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:14:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-29 11:14:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-04-29 11:14:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2025-04-29 11:14:12,402 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 58 [2025-04-29 11:14:12,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:12,406 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2025-04-29 11:14:12,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.026315789473684) internal successors, (115), 38 states have internal predecessors, (115), 0 states have call successors, (0), 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-04-29 11:14:12,406 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2025-04-29 11:14:12,406 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-04-29 11:14:12,406 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:12,407 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:12,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:12,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:14:12,607 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:12,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1790235898, now seen corresponding path program 14 times [2025-04-29 11:14:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:12,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705494131] [2025-04-29 11:14:12,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:14:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:12,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-04-29 11:14:12,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:14:12,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:14:12,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 57 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:13,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705494131] [2025-04-29 11:14:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705494131] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:13,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686959501] [2025-04-29 11:14:13,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:14:13,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:13,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:13,080 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:13,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:14:13,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-04-29 11:14:13,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-04-29 11:14:13,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:14:13,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:13,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-04-29 11:14:13,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 77 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:13,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:13,642 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:14:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 77 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686959501] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:13,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 52 [2025-04-29 11:14:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066062493] [2025-04-29 11:14:13,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:13,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-29 11:14:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:13,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-29 11:14:13,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=2406, Unknown=0, NotChecked=0, Total=2756 [2025-04-29 11:14:13,849 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 53 states, 52 states have (on average 2.8653846153846154) internal successors, (149), 53 states have internal predecessors, (149), 0 states have call successors, (0), 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-04-29 11:14:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:14,289 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2025-04-29 11:14:14,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-29 11:14:14,289 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.8653846153846154) internal successors, (149), 53 states have internal predecessors, (149), 0 states have call successors, (0), 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 61 [2025-04-29 11:14:14,289 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:14,289 INFO L225 Difference]: With dead ends: 67 [2025-04-29 11:14:14,289 INFO L226 Difference]: Without dead ends: 67 [2025-04-29 11:14:14,290 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=436, Invalid=3224, Unknown=0, NotChecked=0, Total=3660 [2025-04-29 11:14:14,290 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:14,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 433 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:14:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-29 11:14:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-04-29 11:14:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 0 states have call successors, (0), 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-04-29 11:14:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2025-04-29 11:14:14,292 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 61 [2025-04-29 11:14:14,292 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:14,292 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2025-04-29 11:14:14,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.8653846153846154) internal successors, (149), 53 states have internal predecessors, (149), 0 states have call successors, (0), 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-04-29 11:14:14,292 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2025-04-29 11:14:14,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-04-29 11:14:14,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:14,293 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:14,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:14,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:14,494 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:14,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1443421514, now seen corresponding path program 15 times [2025-04-29 11:14:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:14,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445794691] [2025-04-29 11:14:14,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:14:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:14,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 9 equivalence classes. [2025-04-29 11:14:14,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:14:14,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-29 11:14:14,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:14,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445794691] [2025-04-29 11:14:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445794691] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:14,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781348793] [2025-04-29 11:14:14,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:14:14,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:14,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:14,790 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:14,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-29 11:14:14,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 9 equivalence classes. [2025-04-29 11:14:14,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:14:14,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-29 11:14:14,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:14,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-29 11:14:14,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:14,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781348793] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:15,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:15,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2025-04-29 11:14:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293647389] [2025-04-29 11:14:15,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:15,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-29 11:14:15,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:15,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-29 11:14:15,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1611, Unknown=0, NotChecked=0, Total=1722 [2025-04-29 11:14:15,403 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand has 42 states, 42 states have (on average 3.0714285714285716) internal successors, (129), 42 states have internal predecessors, (129), 0 states have call successors, (0), 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-04-29 11:14:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:15,841 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2025-04-29 11:14:15,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-29 11:14:15,842 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.0714285714285716) internal successors, (129), 42 states have internal predecessors, (129), 0 states have call successors, (0), 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 65 [2025-04-29 11:14:15,842 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:15,842 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:14:15,842 INFO L226 Difference]: Without dead ends: 71 [2025-04-29 11:14:15,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=2206, Unknown=0, NotChecked=0, Total=2352 [2025-04-29 11:14:15,843 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:15,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 797 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:14:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-29 11:14:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-04-29 11:14:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 0 states have call successors, (0), 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-04-29 11:14:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2025-04-29 11:14:15,844 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 65 [2025-04-29 11:14:15,844 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:15,844 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2025-04-29 11:14:15,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.0714285714285716) internal successors, (129), 42 states have internal predecessors, (129), 0 states have call successors, (0), 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-04-29 11:14:15,845 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2025-04-29 11:14:15,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-29 11:14:15,845 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:15,845 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:15,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-29 11:14:16,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:16,045 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:16,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash 947723288, now seen corresponding path program 16 times [2025-04-29 11:14:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:16,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448963491] [2025-04-29 11:14:16,046 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:14:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:16,052 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-29 11:14:16,061 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-29 11:14:16,061 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:14:16,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 100 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:16,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448963491] [2025-04-29 11:14:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448963491] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:16,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310135382] [2025-04-29 11:14:16,489 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:14:16,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:16,491 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:16,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-29 11:14:16,538 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-29 11:14:16,580 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-29 11:14:16,580 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:14:16,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:16,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-04-29 11:14:16,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:16,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:14:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 100 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:16,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 117 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:17,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310135382] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:17,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:17,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 22] total 58 [2025-04-29 11:14:17,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58576751] [2025-04-29 11:14:17,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:17,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-04-29 11:14:17,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:17,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-04-29 11:14:17,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=3027, Unknown=0, NotChecked=0, Total=3422 [2025-04-29 11:14:17,642 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 59 states, 58 states have (on average 2.896551724137931) internal successors, (168), 59 states have internal predecessors, (168), 0 states have call successors, (0), 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-04-29 11:14:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:18,122 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2025-04-29 11:14:18,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 11:14:18,123 INFO L79 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.896551724137931) internal successors, (168), 59 states have internal predecessors, (168), 0 states have call successors, (0), 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 68 [2025-04-29 11:14:18,123 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:18,123 INFO L225 Difference]: With dead ends: 74 [2025-04-29 11:14:18,123 INFO L226 Difference]: Without dead ends: 74 [2025-04-29 11:14:18,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=498, Invalid=4058, Unknown=0, NotChecked=0, Total=4556 [2025-04-29 11:14:18,124 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:18,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 456 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:14:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-29 11:14:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-04-29 11:14:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 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-04-29 11:14:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2025-04-29 11:14:18,126 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 68 [2025-04-29 11:14:18,126 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:18,126 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2025-04-29 11:14:18,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.896551724137931) internal successors, (168), 59 states have internal predecessors, (168), 0 states have call successors, (0), 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-04-29 11:14:18,126 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2025-04-29 11:14:18,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-04-29 11:14:18,126 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:18,126 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:18,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-29 11:14:18,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:18,327 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:18,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1037563228, now seen corresponding path program 17 times [2025-04-29 11:14:18,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:18,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505750461] [2025-04-29 11:14:18,327 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:14:18,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:18,334 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 10 equivalence classes. [2025-04-29 11:14:18,363 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 72 of 72 statements. [2025-04-29 11:14:18,364 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-04-29 11:14:18,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 18 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:18,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:18,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505750461] [2025-04-29 11:14:18,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505750461] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:18,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046500646] [2025-04-29 11:14:18,661 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:14:18,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:18,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:18,663 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:18,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-29 11:14:18,715 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 10 equivalence classes. [2025-04-29 11:14:18,780 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 72 of 72 statements. [2025-04-29 11:14:18,780 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-04-29 11:14:18,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:18,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-04-29 11:14:18,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:18,789 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 11:14:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:20,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 117 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046500646] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:22,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:22,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 33, 33] total 87 [2025-04-29 11:14:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379689133] [2025-04-29 11:14:22,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:22,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2025-04-29 11:14:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:22,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2025-04-29 11:14:22,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=6976, Unknown=0, NotChecked=0, Total=7482 [2025-04-29 11:14:22,178 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 87 states, 87 states have (on average 2.3908045977011496) internal successors, (208), 87 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-04-29 11:14:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:24,261 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2025-04-29 11:14:24,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-29 11:14:24,261 INFO L79 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 2.3908045977011496) internal successors, (208), 87 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) Word has length 72 [2025-04-29 11:14:24,261 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:24,262 INFO L225 Difference]: With dead ends: 119 [2025-04-29 11:14:24,262 INFO L226 Difference]: Without dead ends: 82 [2025-04-29 11:14:24,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1133, Invalid=15123, Unknown=0, NotChecked=0, Total=16256 [2025-04-29 11:14:24,265 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 2637 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:24,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 529 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2637 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 11:14:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-29 11:14:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-04-29 11:14:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 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-04-29 11:14:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2025-04-29 11:14:24,267 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2025-04-29 11:14:24,267 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:24,267 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2025-04-29 11:14:24,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 2.3908045977011496) internal successors, (208), 87 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-04-29 11:14:24,268 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2025-04-29 11:14:24,268 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-04-29 11:14:24,268 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:24,268 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:24,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:24,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-29 11:14:24,469 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:24,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1531630, now seen corresponding path program 18 times [2025-04-29 11:14:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:24,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097904704] [2025-04-29 11:14:24,469 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:14:24,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:24,476 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 79 statements into 11 equivalence classes. [2025-04-29 11:14:24,510 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 79 of 79 statements. [2025-04-29 11:14:24,510 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-04-29 11:14:24,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 20 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:25,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:25,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097904704] [2025-04-29 11:14:25,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097904704] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:25,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055581521] [2025-04-29 11:14:25,069 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:14:25,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:25,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:25,071 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:25,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-29 11:14:25,127 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 79 statements into 11 equivalence classes. [2025-04-29 11:14:25,454 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 79 of 79 statements. [2025-04-29 11:14:25,454 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-04-29 11:14:25,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:25,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-29 11:14:25,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 20 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:25,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 20 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:26,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055581521] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:26,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:26,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 62 [2025-04-29 11:14:26,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182455781] [2025-04-29 11:14:26,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:26,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-04-29 11:14:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:26,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-04-29 11:14:26,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3609, Unknown=0, NotChecked=0, Total=3782 [2025-04-29 11:14:26,381 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 62 states, 62 states have (on average 3.0161290322580645) internal successors, (187), 62 states have internal predecessors, (187), 0 states have call successors, (0), 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-04-29 11:14:27,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:27,598 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2025-04-29 11:14:27,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-29 11:14:27,599 INFO L79 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 3.0161290322580645) internal successors, (187), 62 states have internal predecessors, (187), 0 states have call successors, (0), 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-04-29 11:14:27,599 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:27,599 INFO L225 Difference]: With dead ends: 126 [2025-04-29 11:14:27,599 INFO L226 Difference]: Without dead ends: 85 [2025-04-29 11:14:27,600 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=342, Invalid=6464, Unknown=0, NotChecked=0, Total=6806 [2025-04-29 11:14:27,600 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:27,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1382 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:14:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-29 11:14:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2025-04-29 11:14:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2025-04-29 11:14:27,602 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 79 [2025-04-29 11:14:27,602 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:27,602 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2025-04-29 11:14:27,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 3.0161290322580645) internal successors, (187), 62 states have internal predecessors, (187), 0 states have call successors, (0), 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-04-29 11:14:27,602 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2025-04-29 11:14:27,603 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-04-29 11:14:27,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:27,603 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:27,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-29 11:14:27,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 11:14:27,803 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:27,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:27,804 INFO L85 PathProgramCache]: Analyzing trace with hash -106438816, now seen corresponding path program 19 times [2025-04-29 11:14:27,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:27,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282305582] [2025-04-29 11:14:27,804 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:14:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:27,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-29 11:14:27,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-29 11:14:27,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:27,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 126 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:28,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:28,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282305582] [2025-04-29 11:14:28,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282305582] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:28,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646952602] [2025-04-29 11:14:28,532 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:14:28,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:28,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:28,534 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:28,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-29 11:14:28,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-29 11:14:28,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-29 11:14:28,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:28,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:28,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-04-29 11:14:28,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 155 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:28,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:29,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:14:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 155 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:29,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646952602] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:29,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 57 [2025-04-29 11:14:29,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225130507] [2025-04-29 11:14:29,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:29,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-29 11:14:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:29,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-29 11:14:29,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2936, Unknown=0, NotChecked=0, Total=3306 [2025-04-29 11:14:29,520 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 58 states, 57 states have (on average 2.912280701754386) internal successors, (166), 58 states have internal predecessors, (166), 0 states have call successors, (0), 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-04-29 11:14:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:30,103 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2025-04-29 11:14:30,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-29 11:14:30,103 INFO L79 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.912280701754386) internal successors, (166), 58 states have internal predecessors, (166), 0 states have call successors, (0), 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 82 [2025-04-29 11:14:30,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:30,104 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:14:30,104 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:14:30,105 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 122 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=494, Invalid=4198, Unknown=0, NotChecked=0, Total=4692 [2025-04-29 11:14:30,105 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:30,105 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 614 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:14:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:14:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-04-29 11:14:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 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-04-29 11:14:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2025-04-29 11:14:30,107 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 82 [2025-04-29 11:14:30,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:30,107 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2025-04-29 11:14:30,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.912280701754386) internal successors, (166), 58 states have internal predecessors, (166), 0 states have call successors, (0), 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-04-29 11:14:30,107 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2025-04-29 11:14:30,107 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-29 11:14:30,107 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:30,107 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:30,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-29 11:14:30,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:30,308 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:30,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:30,308 INFO L85 PathProgramCache]: Analyzing trace with hash 434099364, now seen corresponding path program 20 times [2025-04-29 11:14:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:30,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52128517] [2025-04-29 11:14:30,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:14:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:30,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-29 11:14:30,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-29 11:14:30,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:14:30,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 22 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:30,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:30,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52128517] [2025-04-29 11:14:30,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52128517] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:30,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862253723] [2025-04-29 11:14:30,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:14:30,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:30,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:30,733 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:30,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-29 11:14:30,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-29 11:14:30,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-29 11:14:30,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:14:30,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:30,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-29 11:14:30,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 22 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:30,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 22 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:14:31,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862253723] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:31,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:31,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 55 [2025-04-29 11:14:31,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214693203] [2025-04-29 11:14:31,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:31,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-29 11:14:31,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:31,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-29 11:14:31,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2825, Unknown=0, NotChecked=0, Total=2970 [2025-04-29 11:14:31,607 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 55 states, 55 states have (on average 3.1272727272727274) internal successors, (172), 55 states have internal predecessors, (172), 0 states have call successors, (0), 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-04-29 11:14:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:32,307 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2025-04-29 11:14:32,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-29 11:14:32,307 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.1272727272727274) internal successors, (172), 55 states have internal predecessors, (172), 0 states have call successors, (0), 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 86 [2025-04-29 11:14:32,307 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:32,307 INFO L225 Difference]: With dead ends: 137 [2025-04-29 11:14:32,308 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:14:32,308 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=3965, Unknown=0, NotChecked=0, Total=4160 [2025-04-29 11:14:32,308 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:32,308 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1384 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:14:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:14:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-04-29 11:14:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 0 states have call successors, (0), 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-04-29 11:14:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2025-04-29 11:14:32,310 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 86 [2025-04-29 11:14:32,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:32,310 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2025-04-29 11:14:32,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.1272727272727274) internal successors, (172), 55 states have internal predecessors, (172), 0 states have call successors, (0), 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-04-29 11:14:32,310 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2025-04-29 11:14:32,311 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-04-29 11:14:32,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:32,311 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:32,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-29 11:14:32,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:32,511 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-29 11:14:32,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:32,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1430617450, now seen corresponding path program 21 times [2025-04-29 11:14:32,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:32,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613412783] [2025-04-29 11:14:32,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:14:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:32,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 13 equivalence classes. [2025-04-29 11:14:32,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 86 of 89 statements. [2025-04-29 11:14:32,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-04-29 11:14:32,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 56 proven. 52 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-04-29 11:14:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:33,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613412783] [2025-04-29 11:14:33,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613412783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:33,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636154940] [2025-04-29 11:14:33,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:14:33,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:33,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:33,330 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:14:33,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-29 11:14:33,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 13 equivalence classes. [2025-04-29 11:14:33,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 86 of 89 statements. [2025-04-29 11:14:33,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-04-29 11:14:33,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:33,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 166 conjuncts are in the unsatisfiable core [2025-04-29 11:14:33,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:33,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 11:14:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 170 proven. 242 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-29 11:14:35,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 412 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-29 11:14:37,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636154940] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:37,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:37,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 41, 41] total 96 [2025-04-29 11:14:37,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195860084] [2025-04-29 11:14:37,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:37,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-04-29 11:14:37,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:37,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-04-29 11:14:37,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=8352, Unknown=0, NotChecked=0, Total=9312 [2025-04-29 11:14:37,838 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 97 states, 96 states have (on average 1.78125) internal successors, (171), 97 states have internal predecessors, (171), 0 states have call successors, (0), 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-04-29 11:14:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:40,951 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2025-04-29 11:14:40,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-29 11:14:40,951 INFO L79 Accepts]: Start accepts. Automaton has has 97 states, 96 states have (on average 1.78125) internal successors, (171), 97 states have internal predecessors, (171), 0 states have call successors, (0), 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 89 [2025-04-29 11:14:40,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:40,952 INFO L225 Difference]: With dead ends: 93 [2025-04-29 11:14:40,952 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:14:40,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7045 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2226, Invalid=19236, Unknown=0, NotChecked=0, Total=21462 [2025-04-29 11:14:40,953 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 2834 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:40,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 206 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2834 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-29 11:14:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:14:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:14:40,957 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-04-29 11:14:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:14:40,957 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2025-04-29 11:14:40,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:40,957 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:14:40,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 96 states have (on average 1.78125) internal successors, (171), 97 states have internal predecessors, (171), 0 states have call successors, (0), 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-04-29 11:14:40,958 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:14:40,958 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:14:40,960 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 5 remaining) [2025-04-29 11:14:40,960 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2025-04-29 11:14:40,960 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2025-04-29 11:14:40,960 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2025-04-29 11:14:40,960 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-04-29 11:14:40,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-29 11:14:41,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:41,163 INFO L422 BasicCegarLoop]: Path program histogram: [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:41,164 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:14:41,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:14:41 BoogieIcfgContainer [2025-04-29 11:14:41,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:14:41,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:14:41,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:14:41,167 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:14:41,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:13:54" (3/4) ... [2025-04-29 11:14:41,168 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:14:41,175 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-04-29 11:14:41,175 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 11:14:41,176 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:14:41,176 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:14:41,230 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:14:41,230 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:14:41,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:14:41,231 INFO L158 Benchmark]: Toolchain (without parser) took 47626.61ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 123.7MB in the beginning and 309.9MB in the end (delta: -186.2MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. [2025-04-29 11:14:41,231 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:14:41,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.22ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 108.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:14:41,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.03ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:14:41,232 INFO L158 Benchmark]: Boogie Preprocessor took 30.79ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:14:41,232 INFO L158 Benchmark]: RCFGBuilder took 279.97ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 93.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:14:41,232 INFO L158 Benchmark]: TraceAbstraction took 47032.77ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 93.2MB in the beginning and 314.3MB in the end (delta: -221.1MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2025-04-29 11:14:41,232 INFO L158 Benchmark]: Witness Printer took 64.13ms. Allocated memory is still 520.1MB. Free memory was 314.3MB in the beginning and 309.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:14:41,233 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.22ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 108.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.03ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.79ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 106.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 279.97ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 93.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 47032.77ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 93.2MB in the beginning and 314.3MB in the end (delta: -221.1MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. * Witness Printer took 64.13ms. Allocated memory is still 520.1MB. Free memory was 314.3MB in the beginning and 309.9MB in the end (delta: 4.4MB). 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: -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: 48]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 30 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 47.0s, OverallIterations: 32, TraceHistogramMax: 12, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 9855 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9261 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20122 IncrementalHoareTripleChecker+Invalid, 20209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 594 mSDtfsCounter, 20122 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2848 GetRequests, 1663 SyntacticMatches, 22 SemanticMatches, 1163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19606 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=31, InterpolantAutomatonStates: 634, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 59 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 2314 NumberOfCodeBlocks, 2308 NumberOfCodeBlocksAsserted, 200 NumberOfCheckSat, 3337 ConstructedInterpolants, 0 QuantifiedInterpolants, 28496 SizeOfPredicates, 176 NumberOfNonLiveVariables, 5725 ConjunctsInSsa, 1251 ConjunctsInUnsatCore, 79 InterpolantComputations, 9 PerfectInterpolantSequences, 2521/10154 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 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:14:41,247 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