./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-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_cstrstr-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 54fa17b8c1bd9a37ad505de1c4eac9886ffa80734cb9ad971d7c77c7ed0d3a20 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:14:44,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:14:44,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:14:44,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:14:44,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:14:44,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:14:44,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:14:44,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:14:44,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:14:44,882 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:14:44,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:14:44,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:14:44,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:14:44,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:14:44,882 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:14:44,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:14:44,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:14:44,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:14:44,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:14:44,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:14:44,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:14:44,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:14:44,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:14:44,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:14:44,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:14:44,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:14:44,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:14:44,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:14:44,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:14:44,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:14:44,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:14:44,887 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 -> 54fa17b8c1bd9a37ad505de1c4eac9886ffa80734cb9ad971d7c77c7ed0d3a20 [2025-04-29 11:14:45,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:14:45,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:14:45,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:14:45,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:14:45,161 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:14:45,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca-2.c [2025-04-29 11:14:46,463 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb875cf7c/8ce569605b294d039d2d33bb57dee5d7/FLAGaaef6a108 [2025-04-29 11:14:46,664 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:14:46,665 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca-2.c [2025-04-29 11:14:46,666 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:14:46,670 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb875cf7c/8ce569605b294d039d2d33bb57dee5d7/FLAGaaef6a108 [2025-04-29 11:14:47,514 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb875cf7c/8ce569605b294d039d2d33bb57dee5d7 [2025-04-29 11:14:47,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:14:47,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:14:47,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:14:47,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:14:47,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:14:47,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720f2ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47, skipping insertion in model container [2025-04-29 11:14:47,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:14:47,676 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:14:47,677 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:14:47,680 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:14:47,687 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:14:47,719 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:14:47,727 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:14:47,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47 WrapperNode [2025-04-29 11:14:47,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:14:47,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:14:47,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:14:47,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:14:47,733 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:14:47" (1/1) ... [2025-04-29 11:14:47,738 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:14:47" (1/1) ... [2025-04-29 11:14:47,755 INFO L138 Inliner]: procedures = 12, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156 [2025-04-29 11:14:47,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:14:47,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:14:47,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:14:47,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:14:47,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,782 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [6, 6]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-04-29 11:14:47,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:14:47,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:14:47,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:14:47,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:14:47,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (1/1) ... [2025-04-29 11:14:47,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:14:47,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:47,827 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:14:47,829 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:14:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:14:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:14:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:14:47,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:14:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:14:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:14:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:14:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:14:47,908 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:14:47,909 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:14:48,178 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-04-29 11:14:48,178 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:14:48,187 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:14:48,187 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-29 11:14:48,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:14:48 BoogieIcfgContainer [2025-04-29 11:14:48,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:14:48,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:14:48,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:14:48,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:14:48,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:14:47" (1/3) ... [2025-04-29 11:14:48,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c011b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:14:48, skipping insertion in model container [2025-04-29 11:14:48,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:14:47" (2/3) ... [2025-04-29 11:14:48,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c011b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:14:48, skipping insertion in model container [2025-04-29 11:14:48,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:14:48" (3/3) ... [2025-04-29 11:14:48,196 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.c [2025-04-29 11:14:48,206 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:14:48,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrstr-alloca-2.c that has 1 procedures, 75 locations, 91 edges, 1 initial locations, 6 loop locations, and 25 error locations. [2025-04-29 11:14:48,236 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:14:48,245 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;@246c52cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:14:48,246 INFO L341 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-04-29 11:14:48,248 INFO L278 IsEmpty]: Start isEmpty. Operand has 75 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 74 states have internal predecessors, (91), 0 states have call successors, (0), 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:48,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:14:48,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:48,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:48,252 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:48,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:48,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-29 11:14:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:48,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071717420] [2025-04-29 11:14:48,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:48,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:14:48,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:14:48,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:48,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:48,507 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:14:48,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:48,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071717420] [2025-04-29 11:14:48,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071717420] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:48,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:48,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:14:48,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249555326] [2025-04-29 11:14:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:48,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:14:48,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:48,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:14:48,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:14:48,534 INFO L87 Difference]: Start difference. First operand has 75 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 74 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:48,603 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2025-04-29 11:14:48,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:14:48,605 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:14:48,605 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:48,609 INFO L225 Difference]: With dead ends: 73 [2025-04-29 11:14:48,609 INFO L226 Difference]: Without dead ends: 71 [2025-04-29 11:14:48,610 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:14:48,614 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 13 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:48,615 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 122 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-29 11:14:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-04-29 11:14:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 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:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2025-04-29 11:14:48,636 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 7 [2025-04-29 11:14:48,637 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:48,637 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2025-04-29 11:14:48,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:48,637 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2025-04-29 11:14:48,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:14:48,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:48,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:48,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:14:48,638 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:48,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:48,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028969, now seen corresponding path program 1 times [2025-04-29 11:14:48,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:48,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364158274] [2025-04-29 11:14:48,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:48,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:48,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:14:48,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:14:48,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:48,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:48,931 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:14:48,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:48,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364158274] [2025-04-29 11:14:48,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364158274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:48,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:48,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:14:48,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848610693] [2025-04-29 11:14:48,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:48,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:14:48,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:48,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:14:48,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:14:48,934 INFO L87 Difference]: Start difference. First operand 71 states and 83 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:14:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:49,007 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2025-04-29 11:14:49,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:14:49,007 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:14:49,007 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:49,008 INFO L225 Difference]: With dead ends: 86 [2025-04-29 11:14:49,008 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:14:49,008 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:14:49,008 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 18 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:49,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 218 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:14:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2025-04-29 11:14:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.6923076923076923) internal successors, (88), 74 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2025-04-29 11:14:49,016 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 7 [2025-04-29 11:14:49,016 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:49,016 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2025-04-29 11:14:49,017 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:14:49,020 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2025-04-29 11:14:49,021 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:14:49,021 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:49,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:49,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:14:49,021 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:49,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876011, now seen corresponding path program 1 times [2025-04-29 11:14:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:49,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265898441] [2025-04-29 11:14:49,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:49,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:14:49,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:14:49,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:49,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:49,200 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:14:49,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:49,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265898441] [2025-04-29 11:14:49,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265898441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:49,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:49,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:14:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821199706] [2025-04-29 11:14:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:49,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:14:49,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:49,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:14:49,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:14:49,201 INFO L87 Difference]: Start difference. First operand 75 states and 88 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:14:49,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:49,294 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2025-04-29 11:14:49,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:14:49,294 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:14:49,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:49,295 INFO L225 Difference]: With dead ends: 78 [2025-04-29 11:14:49,295 INFO L226 Difference]: Without dead ends: 78 [2025-04-29 11:14:49,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:14:49,296 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 18 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:49,296 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 304 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-29 11:14:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2025-04-29 11:14:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.7) internal successors, (85), 72 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:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2025-04-29 11:14:49,299 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 7 [2025-04-29 11:14:49,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:49,299 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2025-04-29 11:14:49,299 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:14:49,299 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2025-04-29 11:14:49,299 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:14:49,299 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:49,299 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:49,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:14:49,300 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:49,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash 627432691, now seen corresponding path program 1 times [2025-04-29 11:14:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:49,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038752589] [2025-04-29 11:14:49,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:49,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:14:49,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:14:49,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:49,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:49,359 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:14:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:49,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038752589] [2025-04-29 11:14:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038752589] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:49,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994567953] [2025-04-29 11:14:49,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:49,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:49,362 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:14:49,364 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:14:49,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:14:49,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:14:49,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:49,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:49,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:14:49,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:49,457 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:14:49,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:14:49,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994567953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:49,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:14:49,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:14:49,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878616070] [2025-04-29 11:14:49,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:49,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:14:49,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:49,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:14:49,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:14:49,458 INFO L87 Difference]: Start difference. First operand 73 states and 85 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:14:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:49,502 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2025-04-29 11:14:49,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:14:49,502 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:14:49,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:49,503 INFO L225 Difference]: With dead ends: 85 [2025-04-29 11:14:49,505 INFO L226 Difference]: Without dead ends: 85 [2025-04-29 11:14:49,505 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:14:49,506 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 8 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 223 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:14:49,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 223 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-29 11:14:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2025-04-29 11:14:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 78 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:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2025-04-29 11:14:49,514 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 10 [2025-04-29 11:14:49,514 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:49,514 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2025-04-29 11:14:49,514 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:14:49,514 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2025-04-29 11:14:49,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:14:49,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:49,514 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:49,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:14:49,715 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:14:49,715 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:49,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:49,715 INFO L85 PathProgramCache]: Analyzing trace with hash -181913935, now seen corresponding path program 1 times [2025-04-29 11:14:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:49,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726223129] [2025-04-29 11:14:49,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:49,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:49,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:14:49,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:14:49,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:49,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:49,956 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:14:49,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:49,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726223129] [2025-04-29 11:14:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726223129] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:49,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209905225] [2025-04-29 11:14:49,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:49,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:49,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:49,959 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:14:49,960 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:14:49,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:14:49,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:14:49,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:49,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:49,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:14:49,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:50,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:14:50,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-04-29 11:14:50,046 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 10 treesize of output 8 [2025-04-29 11:14:50,184 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:14:50,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:50,337 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:14:50,374 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:14:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209905225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:50,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:50,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-29 11:14:50,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374680574] [2025-04-29 11:14:50,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:50,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:14:50,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:50,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:14:50,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:14:50,377 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 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:14:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:50,580 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-04-29 11:14:50,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:14:50,583 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 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:14:50,584 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:50,584 INFO L225 Difference]: With dead ends: 79 [2025-04-29 11:14:50,584 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:14:50,584 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:14:50,585 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:50,585 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 558 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:14:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2025-04-29 11:14:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 76 states have internal predecessors, (90), 0 states have call successors, (0), 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:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2025-04-29 11:14:50,590 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 10 [2025-04-29 11:14:50,590 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:50,590 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2025-04-29 11:14:50,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 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:14:50,590 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2025-04-29 11:14:50,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:14:50,590 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:50,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:50,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:14:50,791 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:14:50,791 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:50,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:50,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2024416852, now seen corresponding path program 1 times [2025-04-29 11:14:50,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:50,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335833492] [2025-04-29 11:14:50,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:50,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:14:50,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:14:50,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:50,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:50,827 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:14:50,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:50,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335833492] [2025-04-29 11:14:50,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335833492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:50,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:50,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:14:50,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130135750] [2025-04-29 11:14:50,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:50,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:14:50,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:50,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:14:50,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:14:50,829 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:50,847 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2025-04-29 11:14:50,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:14:50,849 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:14:50,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:50,849 INFO L225 Difference]: With dead ends: 81 [2025-04-29 11:14:50,849 INFO L226 Difference]: Without dead ends: 81 [2025-04-29 11:14:50,849 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:14:50,850 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 14 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:50,850 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 207 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-29 11:14:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-04-29 11:14:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.625) internal successors, (91), 77 states have internal predecessors, (91), 0 states have call successors, (0), 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:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2025-04-29 11:14:50,852 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 11 [2025-04-29 11:14:50,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:50,854 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2025-04-29 11:14:50,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:50,855 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2025-04-29 11:14:50,855 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:14:50,855 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:50,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:50,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:14:50,856 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:50,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2024417044, now seen corresponding path program 1 times [2025-04-29 11:14:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:50,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118363524] [2025-04-29 11:14:50,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:50,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:14:50,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:14:50,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:50,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:50,991 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:14:50,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:50,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118363524] [2025-04-29 11:14:50,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118363524] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:50,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:50,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:14:50,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033106022] [2025-04-29 11:14:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:50,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:14:50,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:50,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:14:50,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:14:50,993 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:51,081 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2025-04-29 11:14:51,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:14:51,082 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:14:51,082 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:51,082 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:14:51,082 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:14:51,083 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:14:51,083 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 30 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:51,083 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 244 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:14:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2025-04-29 11:14:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 89 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2025-04-29 11:14:51,089 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 11 [2025-04-29 11:14:51,089 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:51,089 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2025-04-29 11:14:51,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,090 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2025-04-29 11:14:51,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:14:51,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:51,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:51,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:14:51,090 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:51,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2024417045, now seen corresponding path program 1 times [2025-04-29 11:14:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:51,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924883478] [2025-04-29 11:14:51,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:51,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:14:51,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:14:51,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:51,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:51,129 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:14:51,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:51,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924883478] [2025-04-29 11:14:51,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924883478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:51,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:51,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:14:51,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235776157] [2025-04-29 11:14:51,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:51,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:14:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:51,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:14:51,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:14:51,131 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:51,155 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2025-04-29 11:14:51,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:14:51,156 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:14:51,156 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:51,156 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:14:51,157 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:14:51,157 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:14:51,157 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:51,157 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:14:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-04-29 11:14:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.5) internal successors, (102), 87 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:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2025-04-29 11:14:51,165 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 11 [2025-04-29 11:14:51,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:51,167 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2025-04-29 11:14:51,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,167 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2025-04-29 11:14:51,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:14:51,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:51,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:51,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:14:51,167 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:51,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1461203626, now seen corresponding path program 1 times [2025-04-29 11:14:51,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:51,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125668834] [2025-04-29 11:14:51,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:51,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:51,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:14:51,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:14:51,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:51,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:51,268 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:14:51,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:51,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125668834] [2025-04-29 11:14:51,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125668834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:51,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:51,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:14:51,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832305692] [2025-04-29 11:14:51,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:51,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:14:51,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:51,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:14:51,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:14:51,269 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:51,319 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2025-04-29 11:14:51,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:14:51,319 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:14:51,319 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:51,320 INFO L225 Difference]: With dead ends: 89 [2025-04-29 11:14:51,320 INFO L226 Difference]: Without dead ends: 89 [2025-04-29 11:14:51,320 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:14:51,320 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 14 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:51,320 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 226 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-29 11:14:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2025-04-29 11:14:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 75 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2025-04-29 11:14:51,323 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 11 [2025-04-29 11:14:51,323 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:51,323 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2025-04-29 11:14:51,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,323 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2025-04-29 11:14:51,323 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:14:51,323 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:51,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:51,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:14:51,324 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:51,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash 522585882, now seen corresponding path program 1 times [2025-04-29 11:14:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:51,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702151866] [2025-04-29 11:14:51,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:51,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:14:51,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:14:51,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:51,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:51,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:51,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702151866] [2025-04-29 11:14:51,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702151866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:51,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903183271] [2025-04-29 11:14:51,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:51,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:51,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:51,406 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:14:51,408 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:14:51,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:14:51,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:14:51,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:51,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:51,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:14:51,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:51,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:51,563 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:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903183271] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:51,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:51,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-04-29 11:14:51,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863331303] [2025-04-29 11:14:51,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:51,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:14:51,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:51,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:14:51,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:14:51,598 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:51,673 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2025-04-29 11:14:51,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:14:51,674 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:14:51,674 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:51,674 INFO L225 Difference]: With dead ends: 83 [2025-04-29 11:14:51,674 INFO L226 Difference]: Without dead ends: 83 [2025-04-29 11:14:51,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:14:51,675 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 8 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:51,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 268 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-29 11:14:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-04-29 11:14:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 81 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2025-04-29 11:14:51,677 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 14 [2025-04-29 11:14:51,677 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:51,677 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2025-04-29 11:14:51,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:51,677 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2025-04-29 11:14:51,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:14:51,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:51,679 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:51,687 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:14:51,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:51,879 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:51,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash 522585690, now seen corresponding path program 1 times [2025-04-29 11:14:51,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:51,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124968788] [2025-04-29 11:14:51,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:51,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:51,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:14:51,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:14:51,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:51,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:51,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:51,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124968788] [2025-04-29 11:14:51,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124968788] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:51,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522161653] [2025-04-29 11:14:51,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:51,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:51,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:51,924 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:14:51,926 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:14:51,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:14:51,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:14:51,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:51,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:51,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:14:51,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:51,997 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:14:51,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:14:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522161653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:51,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:14:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:14:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20774148] [2025-04-29 11:14:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:51,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:14:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:51,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:14:51,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:14:51,998 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:52,018 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2025-04-29 11:14:52,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:14:52,019 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:14:52,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:52,019 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:14:52,019 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:14:52,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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:14:52,020 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 3 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:52,020 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 281 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:14:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2025-04-29 11:14:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 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:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2025-04-29 11:14:52,022 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 14 [2025-04-29 11:14:52,022 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:52,022 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2025-04-29 11:14:52,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:52,022 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2025-04-29 11:14:52,022 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:14:52,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:52,022 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:52,028 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:14:52,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:52,227 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:52,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:52,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1223650268, now seen corresponding path program 1 times [2025-04-29 11:14:52,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:52,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690985712] [2025-04-29 11:14:52,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:52,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:52,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:14:52,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:14:52,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:52,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:52,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:52,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690985712] [2025-04-29 11:14:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690985712] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:52,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543250330] [2025-04-29 11:14:52,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:52,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:52,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:52,381 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:14:52,383 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:14:52,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:14:52,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:14:52,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:52,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:52,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:14:52,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:52,442 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-04-29 11:14:52,447 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:14:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:52,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:52,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543250330] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:52,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:52,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-04-29 11:14:52,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167774756] [2025-04-29 11:14:52,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:52,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:14:52,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:52,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:14:52,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:14:52,822 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 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:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:53,004 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2025-04-29 11:14:53,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:14:53,004 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 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 14 [2025-04-29 11:14:53,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:53,004 INFO L225 Difference]: With dead ends: 101 [2025-04-29 11:14:53,004 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:14:53,005 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:14:53,005 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 13 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:53,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 492 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:14:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-04-29 11:14:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 96 states have internal predecessors, (112), 0 states have call successors, (0), 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:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2025-04-29 11:14:53,008 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 14 [2025-04-29 11:14:53,008 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:53,008 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2025-04-29 11:14:53,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 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:53,008 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2025-04-29 11:14:53,009 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:14:53,009 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:53,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:53,014 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:14:53,213 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,SelfDestructingSolverStorable11 [2025-04-29 11:14:53,213 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:53,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash 780751320, now seen corresponding path program 1 times [2025-04-29 11:14:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:53,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893296396] [2025-04-29 11:14:53,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:53,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:14:53,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:14:53,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:53,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:53,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:53,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893296396] [2025-04-29 11:14:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893296396] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:53,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:53,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:14:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777907546] [2025-04-29 11:14:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:53,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:14:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:53,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:14:53,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:14:53,299 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:53,318 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2025-04-29 11:14:53,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:14:53,319 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:14:53,319 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:53,319 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:14:53,319 INFO L226 Difference]: Without dead ends: 96 [2025-04-29 11:14:53,319 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:14:53,320 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:53,320 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:53,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-29 11:14:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2025-04-29 11:14:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 86 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:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2025-04-29 11:14:53,322 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 14 [2025-04-29 11:14:53,322 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:53,322 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2025-04-29 11:14:53,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:53,326 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2025-04-29 11:14:53,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:14:53,326 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:53,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:53,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:14:53,326 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:53,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:53,327 INFO L85 PathProgramCache]: Analyzing trace with hash -900458095, now seen corresponding path program 1 times [2025-04-29 11:14:53,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:53,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823717265] [2025-04-29 11:14:53,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:53,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:53,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:14:53,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:14:53,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:53,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:53,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:53,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823717265] [2025-04-29 11:14:53,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823717265] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:53,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:53,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:14:53,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647984174] [2025-04-29 11:14:53,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:53,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:14:53,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:53,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:14:53,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:14:53,375 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:53,410 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2025-04-29 11:14:53,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:14:53,411 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:14:53,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:53,411 INFO L225 Difference]: With dead ends: 86 [2025-04-29 11:14:53,411 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:14:53,411 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:14:53,412 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 5 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:53,412 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:14:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-29 11:14:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 85 states have internal predecessors, (100), 0 states have call successors, (0), 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:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2025-04-29 11:14:53,414 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 17 [2025-04-29 11:14:53,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:53,414 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2025-04-29 11:14:53,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:53,414 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2025-04-29 11:14:53,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:14:53,417 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:53,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:53,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:14:53,417 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:53,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:53,418 INFO L85 PathProgramCache]: Analyzing trace with hash -900458094, now seen corresponding path program 1 times [2025-04-29 11:14:53,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:53,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798334410] [2025-04-29 11:14:53,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:53,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:14:53,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:14:53,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:53,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:53,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:53,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798334410] [2025-04-29 11:14:53,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798334410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:53,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83914923] [2025-04-29 11:14:53,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:53,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:53,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:53,615 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:14:53,616 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:14:53,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:14:53,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:14:53,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:53,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:53,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:14:53,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:53,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:53,728 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:14:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:53,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83914923] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:53,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:53,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-04-29 11:14:53,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920664097] [2025-04-29 11:14:53,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:53,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:14:53,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:53,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:14:53,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:14:53,745 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 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:14:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:53,839 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2025-04-29 11:14:53,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:14:53,839 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 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) Word has length 17 [2025-04-29 11:14:53,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:53,840 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:14:53,840 INFO L226 Difference]: Without dead ends: 87 [2025-04-29 11:14:53,840 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:14:53,840 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 10 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:53,840 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 478 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-29 11:14:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2025-04-29 11:14:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 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:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2025-04-29 11:14:53,842 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 17 [2025-04-29 11:14:53,842 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:53,842 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2025-04-29 11:14:53,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 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:14:53,842 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2025-04-29 11:14:53,843 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:14:53,843 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:53,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:53,849 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:14:54,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:14:54,044 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:54,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:54,044 INFO L85 PathProgramCache]: Analyzing trace with hash 818638659, now seen corresponding path program 1 times [2025-04-29 11:14:54,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:54,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468331016] [2025-04-29 11:14:54,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:54,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:54,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:14:54,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:14:54,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:54,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:14:54,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:54,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468331016] [2025-04-29 11:14:54,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468331016] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:54,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:14:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27230266] [2025-04-29 11:14:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:54,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:14:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:54,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:14:54,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:14:54,084 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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:14:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:54,127 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2025-04-29 11:14:54,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:14:54,128 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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 20 [2025-04-29 11:14:54,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:54,128 INFO L225 Difference]: With dead ends: 84 [2025-04-29 11:14:54,128 INFO L226 Difference]: Without dead ends: 84 [2025-04-29 11:14:54,128 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:14:54,129 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:54,129 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 161 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-29 11:14:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-04-29 11:14:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.4) internal successors, (98), 83 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:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2025-04-29 11:14:54,131 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 20 [2025-04-29 11:14:54,131 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:54,131 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2025-04-29 11:14:54,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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:14:54,131 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2025-04-29 11:14:54,131 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:14:54,131 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:54,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:54,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:14:54,132 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:54,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash 818638660, now seen corresponding path program 1 times [2025-04-29 11:14:54,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:54,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749356445] [2025-04-29 11:14:54,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:54,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:54,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:14:54,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:14:54,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:54,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:54,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749356445] [2025-04-29 11:14:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749356445] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:54,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183347094] [2025-04-29 11:14:54,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:54,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:54,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:54,287 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:14:54,288 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:14:54,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:14:54,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:14:54,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:54,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:54,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:14:54,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:54,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:14:54,416 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:14:54,417 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:14:54,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2025-04-29 11:14:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:14:54,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:14:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183347094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:54,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:14:54,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2025-04-29 11:14:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210315821] [2025-04-29 11:14:54,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:54,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:14:54,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:54,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:14:54,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:14:54,422 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:14:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:54,470 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2025-04-29 11:14:54,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:14:54,470 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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 20 [2025-04-29 11:14:54,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:54,471 INFO L225 Difference]: With dead ends: 90 [2025-04-29 11:14:54,471 INFO L226 Difference]: Without dead ends: 90 [2025-04-29 11:14:54,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:14:54,471 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:54,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 435 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-29 11:14:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-04-29 11:14:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.368421052631579) internal successors, (104), 89 states have internal predecessors, (104), 0 states have call successors, (0), 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:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2025-04-29 11:14:54,473 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 20 [2025-04-29 11:14:54,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:54,473 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2025-04-29 11:14:54,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:14:54,473 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2025-04-29 11:14:54,474 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:14:54,474 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:54,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:54,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:54,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:54,674 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:54,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:54,674 INFO L85 PathProgramCache]: Analyzing trace with hash -769709242, now seen corresponding path program 1 times [2025-04-29 11:14:54,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:54,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231393544] [2025-04-29 11:14:54,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:54,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:54,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:14:54,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:14:54,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:54,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:55,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:55,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231393544] [2025-04-29 11:14:55,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231393544] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:55,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378488828] [2025-04-29 11:14:55,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:55,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:55,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:55,035 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:55,037 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:55,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:14:55,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:14:55,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:55,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:55,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:14:55,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:55,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:14:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:55,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:55,210 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-29 11:14:55,211 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 14 treesize of output 12 [2025-04-29 11:14:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:55,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378488828] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:55,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:55,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2025-04-29 11:14:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351534724] [2025-04-29 11:14:55,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:55,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:14:55,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:55,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:14:55,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:14:55,255 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:55,688 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2025-04-29 11:14:55,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:14:55,689 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:14:55,689 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:55,689 INFO L225 Difference]: With dead ends: 107 [2025-04-29 11:14:55,689 INFO L226 Difference]: Without dead ends: 107 [2025-04-29 11:14:55,690 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 11:14:55,690 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 156 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:55,690 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 701 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:14:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-29 11:14:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2025-04-29 11:14:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.3625) internal successors, (109), 93 states have internal predecessors, (109), 0 states have call successors, (0), 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:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2025-04-29 11:14:55,692 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 20 [2025-04-29 11:14:55,692 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:55,692 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2025-04-29 11:14:55,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:55,693 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2025-04-29 11:14:55,693 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:14:55,693 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:55,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:55,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:14:55,893 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,SelfDestructingSolverStorable17 [2025-04-29 11:14:55,894 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:55,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash 735967266, now seen corresponding path program 1 times [2025-04-29 11:14:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:55,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373476397] [2025-04-29 11:14:55,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:55,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:14:55,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:14:55,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:55,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:14:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:55,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373476397] [2025-04-29 11:14:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373476397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:55,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:55,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:14:55,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121611362] [2025-04-29 11:14:55,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:55,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:14:55,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:55,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:14:55,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:14:55,968 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:14:55,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:55,994 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2025-04-29 11:14:55,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:14:55,995 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) Word has length 22 [2025-04-29 11:14:55,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:55,995 INFO L225 Difference]: With dead ends: 93 [2025-04-29 11:14:55,995 INFO L226 Difference]: Without dead ends: 69 [2025-04-29 11:14:55,995 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:14:55,995 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 52 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:55,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 104 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:55,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-29 11:14:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-04-29 11:14:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 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:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-04-29 11:14:55,997 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 22 [2025-04-29 11:14:55,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:55,997 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-04-29 11:14:55,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:14:55,998 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-04-29 11:14:55,998 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:14:55,998 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:55,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:55,998 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:14:55,998 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:55,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1030898207, now seen corresponding path program 1 times [2025-04-29 11:14:55,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:55,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045235676] [2025-04-29 11:14:55,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:56,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:14:56,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:14:56,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:56,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:56,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:56,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045235676] [2025-04-29 11:14:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045235676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:56,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164920958] [2025-04-29 11:14:56,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:56,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:56,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:56,252 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:56,253 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:56,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:14:56,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:14:56,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:56,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:56,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-29 11:14:56,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:56,378 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:14:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:56,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:56,437 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:14:56,438 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 16 treesize of output 12 [2025-04-29 11:14:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:56,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164920958] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:56,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:56,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 24 [2025-04-29 11:14:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867011809] [2025-04-29 11:14:56,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:56,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:14:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:56,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:14:56,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:14:56,481 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 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:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:56,672 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2025-04-29 11:14:56,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:14:56,672 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 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) Word has length 26 [2025-04-29 11:14:56,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:56,673 INFO L225 Difference]: With dead ends: 118 [2025-04-29 11:14:56,673 INFO L226 Difference]: Without dead ends: 118 [2025-04-29 11:14:56,673 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:14:56,674 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 63 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:56,674 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 756 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-29 11:14:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2025-04-29 11:14:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 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:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2025-04-29 11:14:56,676 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 26 [2025-04-29 11:14:56,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:56,676 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2025-04-29 11:14:56,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 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:56,676 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2025-04-29 11:14:56,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:14:56,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:56,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:56,683 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:56,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:56,877 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:56,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:56,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1884060222, now seen corresponding path program 1 times [2025-04-29 11:14:56,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:56,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929977847] [2025-04-29 11:14:56,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:56,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:56,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:14:56,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:14:56,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:56,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:14:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:56,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929977847] [2025-04-29 11:14:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929977847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:14:56,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:14:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:14:56,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388133195] [2025-04-29 11:14:56,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:14:56,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:14:56,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:56,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:14:56,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:14:56,922 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:14:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:56,961 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2025-04-29 11:14:56,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:14:56,961 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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) Word has length 29 [2025-04-29 11:14:56,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:56,961 INFO L225 Difference]: With dead ends: 79 [2025-04-29 11:14:56,961 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:14:56,962 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:14:56,962 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 40 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:56,962 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:14:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:14:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-04-29 11:14:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.328358208955224) internal successors, (89), 78 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:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2025-04-29 11:14:56,964 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 29 [2025-04-29 11:14:56,964 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:56,964 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2025-04-29 11:14:56,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:14:56,964 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2025-04-29 11:14:56,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:14:56,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:56,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:56,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:14:56,964 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:56,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:56,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1884060223, now seen corresponding path program 1 times [2025-04-29 11:14:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:56,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542429878] [2025-04-29 11:14:56,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:56,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:56,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:14:56,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:14:56,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:56,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:14:57,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:57,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542429878] [2025-04-29 11:14:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542429878] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:57,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926841461] [2025-04-29 11:14:57,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:14:57,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:57,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:57,060 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:57,061 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:57,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:14:57,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:14:57,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:14:57,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:57,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:14:57,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:14:57,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:57,258 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:14:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:14:57,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926841461] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:57,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:57,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-29 11:14:57,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902708421] [2025-04-29 11:14:57,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:57,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:14:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:57,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:14:57,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:14:57,265 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 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:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:57,350 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2025-04-29 11:14:57,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:14:57,358 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:14:57,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:57,358 INFO L225 Difference]: With dead ends: 84 [2025-04-29 11:14:57,358 INFO L226 Difference]: Without dead ends: 84 [2025-04-29 11:14:57,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:14:57,359 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:57,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 330 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:14:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-29 11:14:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2025-04-29 11:14:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 81 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:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-04-29 11:14:57,361 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 29 [2025-04-29 11:14:57,361 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:57,361 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-04-29 11:14:57,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 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:57,363 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-04-29 11:14:57,363 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:14:57,364 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:57,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:57,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:57,564 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,SelfDestructingSolverStorable21 [2025-04-29 11:14:57,564 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:57,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1866810769, now seen corresponding path program 2 times [2025-04-29 11:14:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:57,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819540619] [2025-04-29 11:14:57,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:14:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:57,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-29 11:14:57,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:14:57,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:14:57,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:57,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:57,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819540619] [2025-04-29 11:14:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819540619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:57,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056476067] [2025-04-29 11:14:57,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:14:57,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:57,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:57,818 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:57,820 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:57,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-29 11:14:57,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:14:57,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:14:57,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:57,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-29 11:14:57,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:57,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:14:58,067 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 21 treesize of output 17 [2025-04-29 11:14:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:14:58,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056476067] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:14:58,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:14:58,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-04-29 11:14:58,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176067453] [2025-04-29 11:14:58,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:14:58,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:14:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:14:58,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:14:58,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:14:58,169 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 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:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:14:58,454 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2025-04-29 11:14:58,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:14:58,455 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 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 29 [2025-04-29 11:14:58,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:14:58,455 INFO L225 Difference]: With dead ends: 128 [2025-04-29 11:14:58,455 INFO L226 Difference]: Without dead ends: 128 [2025-04-29 11:14:58,456 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:14:58,456 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 78 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:14:58,456 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 571 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:14:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-29 11:14:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 85. [2025-04-29 11:14:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 84 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:14:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2025-04-29 11:14:58,458 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 29 [2025-04-29 11:14:58,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:14:58,458 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2025-04-29 11:14:58,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 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:58,458 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2025-04-29 11:14:58,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:14:58,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:14:58,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:14:58,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 11:14:58,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 11:14:58,663 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:14:58,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:14:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1371894758, now seen corresponding path program 3 times [2025-04-29 11:14:58,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:14:58,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050700666] [2025-04-29 11:14:58,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:14:58,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:14:58,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-04-29 11:14:58,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 32 statements. [2025-04-29 11:14:58,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:14:58,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 11:14:59,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:14:59,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050700666] [2025-04-29 11:14:59,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050700666] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:14:59,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134471958] [2025-04-29 11:14:59,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:14:59,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:14:59,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:14:59,150 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:59,151 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:59,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-04-29 11:14:59,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 32 statements. [2025-04-29 11:14:59,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:14:59,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:14:59,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-29 11:14:59,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:14:59,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-29 11:14:59,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:14:59,656 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-29 11:14:59,657 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 31 [2025-04-29 11:14:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 11:14:59,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:00,111 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-29 11:15:00,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2025-04-29 11:15:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-29 11:15:00,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134471958] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:00,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:00,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2025-04-29 11:15:00,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854656057] [2025-04-29 11:15:00,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:00,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-29 11:15:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:00,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-29 11:15:00,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2025-04-29 11:15:00,300 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 37 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:15:01,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:01,675 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2025-04-29 11:15:01,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:15:01,675 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 37 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) Word has length 32 [2025-04-29 11:15:01,675 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:01,676 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:15:01,676 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:15:01,676 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=370, Invalid=2180, Unknown=0, NotChecked=0, Total=2550 [2025-04-29 11:15:01,677 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 206 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:01,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 690 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:15:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:15:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2025-04-29 11:15:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 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:15:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2025-04-29 11:15:01,678 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 32 [2025-04-29 11:15:01,678 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:01,678 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2025-04-29 11:15:01,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 37 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:15:01,679 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2025-04-29 11:15:01,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:15:01,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:01,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:01,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:15:01,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:15:01,883 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:01,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:01,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2064131032, now seen corresponding path program 1 times [2025-04-29 11:15:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:01,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836992806] [2025-04-29 11:15:01,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:01,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:01,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:15:01,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:15:01,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:01,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:02,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:02,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836992806] [2025-04-29 11:15:02,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836992806] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:02,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306317722] [2025-04-29 11:15:02,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:02,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:02,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:02,027 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:15:02,029 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:15:02,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:15:02,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:15:02,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:02,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:02,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:15:02,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:02,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:15:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:15:02,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:15:02,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306317722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:02,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:15:02,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 11 [2025-04-29 11:15:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706691370] [2025-04-29 11:15:02,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:02,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:15:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:02,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:15:02,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:15:02,144 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:02,184 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2025-04-29 11:15:02,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:15:02,184 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-29 11:15:02,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:02,184 INFO L225 Difference]: With dead ends: 114 [2025-04-29 11:15:02,184 INFO L226 Difference]: Without dead ends: 74 [2025-04-29 11:15:02,185 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:15:02,185 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:02,185 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:15:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-29 11:15:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-04-29 11:15:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 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:15:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2025-04-29 11:15:02,187 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 34 [2025-04-29 11:15:02,187 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:02,187 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2025-04-29 11:15:02,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:02,187 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2025-04-29 11:15:02,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:15:02,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:02,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:02,193 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:15:02,388 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,SelfDestructingSolverStorable24 [2025-04-29 11:15:02,388 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:02,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1956076650, now seen corresponding path program 1 times [2025-04-29 11:15:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:02,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791334824] [2025-04-29 11:15:02,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:02,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:15:02,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:15:02,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:02,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:02,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:02,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791334824] [2025-04-29 11:15:02,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791334824] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:02,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685928223] [2025-04-29 11:15:02,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:02,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:02,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:02,541 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:15:02,543 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:15:02,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:15:02,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:15:02,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:02,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:02,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:15:02,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:02,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:15:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:02,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:02,711 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-29 11:15:02,713 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 14 treesize of output 12 [2025-04-29 11:15:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:02,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685928223] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:02,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:02,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-04-29 11:15:02,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957954407] [2025-04-29 11:15:02,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:02,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:15:02,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:02,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:15:02,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:15:02,753 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:02,853 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2025-04-29 11:15:02,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:02,854 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-29 11:15:02,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:02,854 INFO L225 Difference]: With dead ends: 113 [2025-04-29 11:15:02,854 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:15:02,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:15:02,855 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:02,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 754 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:15:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:15:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2025-04-29 11:15:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.303030303030303) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2025-04-29 11:15:02,856 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 34 [2025-04-29 11:15:02,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:02,856 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2025-04-29 11:15:02,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:02,856 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2025-04-29 11:15:02,856 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:15:02,856 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:02,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:02,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:03,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:03,057 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:03,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1226471860, now seen corresponding path program 2 times [2025-04-29 11:15:03,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:03,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995990006] [2025-04-29 11:15:03,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:03,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:03,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-29 11:15:03,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:15:03,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:03,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:03,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:03,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995990006] [2025-04-29 11:15:03,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995990006] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:03,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652135232] [2025-04-29 11:15:03,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:03,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:03,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:03,212 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:15:03,213 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:15:03,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-29 11:15:03,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:15:03,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:03,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:03,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:15:03,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:03,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-29 11:15:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:03,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652135232] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:03,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-04-29 11:15:03,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045069571] [2025-04-29 11:15:03,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:03,550 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:15:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:03,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:15:03,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:15:03,551 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 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:15:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:03,670 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2025-04-29 11:15:03,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:03,670 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 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) Word has length 37 [2025-04-29 11:15:03,670 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:03,670 INFO L225 Difference]: With dead ends: 110 [2025-04-29 11:15:03,670 INFO L226 Difference]: Without dead ends: 110 [2025-04-29 11:15:03,671 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:15:03,671 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:03,671 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 348 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:15:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-29 11:15:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2025-04-29 11:15:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 98 states have internal predecessors, (123), 0 states have call successors, (0), 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:15:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2025-04-29 11:15:03,673 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 37 [2025-04-29 11:15:03,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:03,673 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2025-04-29 11:15:03,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 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:15:03,673 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2025-04-29 11:15:03,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:15:03,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:03,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:03,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:03,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 11:15:03,877 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:03,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash 634156600, now seen corresponding path program 1 times [2025-04-29 11:15:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:03,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761896960] [2025-04-29 11:15:03,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:03,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:03,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:15:03,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:15:03,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:03,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:15:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:03,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761896960] [2025-04-29 11:15:03,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761896960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:03,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:15:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903054802] [2025-04-29 11:15:03,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:03,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:03,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:03,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:03,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:03,929 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 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:15:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:03,971 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2025-04-29 11:15:03,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:15:03,971 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-29 11:15:03,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:03,971 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:15:03,971 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:15:03,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:15:03,972 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 47 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:03,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 136 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:15:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:15:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-04-29 11:15:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 96 states have internal predecessors, (119), 0 states have call successors, (0), 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:15:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2025-04-29 11:15:03,974 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 38 [2025-04-29 11:15:03,974 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:03,974 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2025-04-29 11:15:03,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 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:15:03,974 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2025-04-29 11:15:03,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:15:03,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:03,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:03,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:15:03,975 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:03,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 634156601, now seen corresponding path program 1 times [2025-04-29 11:15:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:03,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005096358] [2025-04-29 11:15:03,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:03,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:15:03,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:15:03,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:03,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:04,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:04,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005096358] [2025-04-29 11:15:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005096358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:04,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721347458] [2025-04-29 11:15:04,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:04,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:04,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:04,120 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:15:04,121 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:15:04,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:15:04,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:15:04,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:04,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:04,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:15:04,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:04,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:04,396 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:15:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:04,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721347458] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:04,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:04,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-29 11:15:04,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616807634] [2025-04-29 11:15:04,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:04,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:15:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:04,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:15:04,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:15:04,410 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:04,553 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2025-04-29 11:15:04,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:04,553 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-29 11:15:04,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:04,554 INFO L225 Difference]: With dead ends: 112 [2025-04-29 11:15:04,554 INFO L226 Difference]: Without dead ends: 112 [2025-04-29 11:15:04,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:15:04,554 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 100 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:04,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 311 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:15:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-29 11:15:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2025-04-29 11:15:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 96 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:15:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2025-04-29 11:15:04,556 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 38 [2025-04-29 11:15:04,556 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:04,556 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2025-04-29 11:15:04,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:04,556 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2025-04-29 11:15:04,556 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:15:04,556 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:04,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:04,562 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:15:04,756 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,SelfDestructingSolverStorable28 [2025-04-29 11:15:04,757 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:04,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:04,757 INFO L85 PathProgramCache]: Analyzing trace with hash -460860999, now seen corresponding path program 1 times [2025-04-29 11:15:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:04,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160181592] [2025-04-29 11:15:04,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:04,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:15:04,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:15:04,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:04,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:15:04,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:04,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160181592] [2025-04-29 11:15:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160181592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:04,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:04,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:15:04,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425590832] [2025-04-29 11:15:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:04,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:15:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:04,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:15:04,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:15:04,807 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 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:15:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:04,857 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2025-04-29 11:15:04,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:15:04,857 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-29 11:15:04,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:04,857 INFO L225 Difference]: With dead ends: 98 [2025-04-29 11:15:04,857 INFO L226 Difference]: Without dead ends: 98 [2025-04-29 11:15:04,858 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:15:04,858 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:04,858 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 134 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:15:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-29 11:15:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-04-29 11:15:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 89 states have (on average 1.303370786516854) internal successors, (116), 95 states have internal predecessors, (116), 0 states have call successors, (0), 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:15:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2025-04-29 11:15:04,860 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 40 [2025-04-29 11:15:04,860 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:04,860 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2025-04-29 11:15:04,860 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 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:15:04,860 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2025-04-29 11:15:04,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:15:04,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:04,860 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:04,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:15:04,861 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:04,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash -460860998, now seen corresponding path program 1 times [2025-04-29 11:15:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:04,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686169370] [2025-04-29 11:15:04,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:04,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:04,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:15:04,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:15:04,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:04,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:05,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686169370] [2025-04-29 11:15:05,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686169370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:05,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94557122] [2025-04-29 11:15:05,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:05,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:05,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:05,042 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:15:05,044 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:15:05,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:15:05,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:15:05,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:05,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:05,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:15:05,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:05,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:05,313 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:15:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94557122] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:05,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:05,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2025-04-29 11:15:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673009926] [2025-04-29 11:15:05,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:05,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:15:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:05,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:15:05,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:15:05,332 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 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:15:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:05,479 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2025-04-29 11:15:05,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:05,480 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 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:15:05,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:05,480 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:15:05,480 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:15:05,480 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:15:05,481 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 77 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:05,481 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 362 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:15:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:15:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2025-04-29 11:15:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.297872340425532) internal successors, (122), 100 states have internal predecessors, (122), 0 states have call successors, (0), 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:15:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2025-04-29 11:15:05,482 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 40 [2025-04-29 11:15:05,482 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:05,482 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2025-04-29 11:15:05,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 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:15:05,482 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2025-04-29 11:15:05,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:15:05,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:05,483 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:05,489 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:15:05,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:05,687 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:05,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:05,687 INFO L85 PathProgramCache]: Analyzing trace with hash -60450837, now seen corresponding path program 3 times [2025-04-29 11:15:05,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:05,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387538349] [2025-04-29 11:15:05,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:15:05,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:05,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-04-29 11:15:05,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:15:05,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:15:05,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:05,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387538349] [2025-04-29 11:15:05,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387538349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:05,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957894121] [2025-04-29 11:15:05,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:15:05,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:05,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:06,000 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:15:06,001 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:15:06,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-04-29 11:15:06,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:15:06,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:15:06,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:06,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-29 11:15:06,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:06,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:15:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:06,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:06,226 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:15:06,227 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 16 treesize of output 12 [2025-04-29 11:15:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957894121] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:06,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:06,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 27 [2025-04-29 11:15:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647239939] [2025-04-29 11:15:06,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:06,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:15:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:06,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:15:06,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:15:06,269 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 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:15:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:06,480 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2025-04-29 11:15:06,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:15:06,480 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 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) Word has length 42 [2025-04-29 11:15:06,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:06,481 INFO L225 Difference]: With dead ends: 171 [2025-04-29 11:15:06,481 INFO L226 Difference]: Without dead ends: 162 [2025-04-29 11:15:06,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2025-04-29 11:15:06,482 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 52 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:06,482 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 804 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:15:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-04-29 11:15:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2025-04-29 11:15:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 153 states have internal predecessors, (185), 0 states have call successors, (0), 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:15:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2025-04-29 11:15:06,488 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 42 [2025-04-29 11:15:06,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:06,488 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2025-04-29 11:15:06,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 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:15:06,488 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2025-04-29 11:15:06,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:15:06,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:06,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:06,495 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:15:06,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:06,689 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:06,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:06,690 INFO L85 PathProgramCache]: Analyzing trace with hash -505785606, now seen corresponding path program 1 times [2025-04-29 11:15:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:06,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416560818] [2025-04-29 11:15:06,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:06,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:15:06,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:15:06,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:06,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:15:06,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:06,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416560818] [2025-04-29 11:15:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416560818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:06,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:06,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:15:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050236917] [2025-04-29 11:15:06,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:06,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:15:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:06,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:15:06,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:15:06,741 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 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:15:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:06,792 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2025-04-29 11:15:06,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:15:06,792 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-29 11:15:06,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:06,794 INFO L225 Difference]: With dead ends: 155 [2025-04-29 11:15:06,794 INFO L226 Difference]: Without dead ends: 155 [2025-04-29 11:15:06,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:15:06,794 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 39 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:06,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 169 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:15:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-04-29 11:15:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2025-04-29 11:15:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 147 states have (on average 1.2380952380952381) internal successors, (182), 152 states have internal predecessors, (182), 0 states have call successors, (0), 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:15:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 182 transitions. [2025-04-29 11:15:06,798 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 182 transitions. Word has length 42 [2025-04-29 11:15:06,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:06,798 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 182 transitions. [2025-04-29 11:15:06,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 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:15:06,798 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 182 transitions. [2025-04-29 11:15:06,798 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:15:06,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:06,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:06,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-29 11:15:06,799 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:06,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash -505785605, now seen corresponding path program 1 times [2025-04-29 11:15:06,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:06,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600496999] [2025-04-29 11:15:06,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:06,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:06,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:15:06,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:15:06,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:06,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:06,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:06,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600496999] [2025-04-29 11:15:06,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600496999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:06,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350159066] [2025-04-29 11:15:06,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:06,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:06,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:06,952 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:15:06,957 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:15:07,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:15:07,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:15:07,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:07,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:07,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:15:07,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:07,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:07,294 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:15:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350159066] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:07,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:07,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-29 11:15:07,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844671475] [2025-04-29 11:15:07,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:07,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:15:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:07,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:15:07,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:15:07,312 INFO L87 Difference]: Start difference. First operand 153 states and 182 transitions. Second operand has 21 states, 20 states have (on average 4.7) internal successors, (94), 21 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:15:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:07,486 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2025-04-29 11:15:07,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:15:07,487 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.7) internal successors, (94), 21 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 42 [2025-04-29 11:15:07,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:07,487 INFO L225 Difference]: With dead ends: 163 [2025-04-29 11:15:07,487 INFO L226 Difference]: Without dead ends: 163 [2025-04-29 11:15:07,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:15:07,488 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 83 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:07,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 376 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:15:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-29 11:15:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2025-04-29 11:15:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.217687074829932) internal successors, (179), 151 states have internal predecessors, (179), 0 states have call successors, (0), 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:15:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2025-04-29 11:15:07,490 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 42 [2025-04-29 11:15:07,490 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:07,490 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2025-04-29 11:15:07,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.7) internal successors, (94), 21 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:15:07,491 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2025-04-29 11:15:07,491 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:15:07,491 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:07,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:07,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:07,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:07,694 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:07,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash -728967685, now seen corresponding path program 1 times [2025-04-29 11:15:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:07,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698491965] [2025-04-29 11:15:07,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:07,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:15:07,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:15:07,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:07,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:15:07,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:07,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698491965] [2025-04-29 11:15:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698491965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:07,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:07,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:15:07,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998050981] [2025-04-29 11:15:07,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:07,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:15:07,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:07,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:15:07,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:15:07,756 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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:15:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:07,800 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2025-04-29 11:15:07,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:15:07,800 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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 44 [2025-04-29 11:15:07,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:07,800 INFO L225 Difference]: With dead ends: 153 [2025-04-29 11:15:07,800 INFO L226 Difference]: Without dead ends: 153 [2025-04-29 11:15:07,801 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:15:07,801 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:07,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 131 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:15:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-04-29 11:15:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2025-04-29 11:15:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.1972789115646258) internal successors, (176), 150 states have internal predecessors, (176), 0 states have call successors, (0), 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:15:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2025-04-29 11:15:07,803 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 44 [2025-04-29 11:15:07,803 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:07,803 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2025-04-29 11:15:07,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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:15:07,803 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2025-04-29 11:15:07,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:15:07,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:07,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:07,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:15:07,804 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:07,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash -728967684, now seen corresponding path program 1 times [2025-04-29 11:15:07,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:07,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111755787] [2025-04-29 11:15:07,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:07,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:15:07,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:15:07,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:07,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:08,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:08,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111755787] [2025-04-29 11:15:08,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111755787] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:08,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092990029] [2025-04-29 11:15:08,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:08,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:08,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:08,007 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:15:08,008 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:15:08,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:15:08,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:15:08,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:08,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:08,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:15:08,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:08,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:08,332 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:15:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:08,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092990029] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:08,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:08,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 22 [2025-04-29 11:15:08,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960305963] [2025-04-29 11:15:08,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:08,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:15:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:08,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:15:08,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:15:08,355 INFO L87 Difference]: Start difference. First operand 151 states and 176 transitions. Second operand has 23 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 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:15:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:08,557 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2025-04-29 11:15:08,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:15:08,557 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 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) Word has length 44 [2025-04-29 11:15:08,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:08,557 INFO L225 Difference]: With dead ends: 186 [2025-04-29 11:15:08,557 INFO L226 Difference]: Without dead ends: 183 [2025-04-29 11:15:08,558 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:15:08,558 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 163 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:08,558 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 423 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:15:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-29 11:15:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 160. [2025-04-29 11:15:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 159 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:15:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2025-04-29 11:15:08,560 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 44 [2025-04-29 11:15:08,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:08,560 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2025-04-29 11:15:08,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.045454545454546) internal successors, (89), 23 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:15:08,561 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2025-04-29 11:15:08,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:15:08,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:08,561 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:08,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-29 11:15:08,761 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,SelfDestructingSolverStorable35 [2025-04-29 11:15:08,762 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:08,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1098423135, now seen corresponding path program 4 times [2025-04-29 11:15:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:08,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90372856] [2025-04-29 11:15:08,762 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:15:08,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:08,768 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:15:08,774 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 45 statements. [2025-04-29 11:15:08,774 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:15:08,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:09,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:09,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90372856] [2025-04-29 11:15:09,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90372856] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:09,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648312433] [2025-04-29 11:15:09,255 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:15:09,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:09,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:09,257 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:15:09,258 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:15:09,323 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:15:09,342 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 45 statements. [2025-04-29 11:15:09,342 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:15:09,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:09,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-29 11:15:09,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:09,414 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:15:09,773 INFO L325 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2025-04-29 11:15:09,773 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2025-04-29 11:15:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:15:09,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:10,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-04-29 11:15:10,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-29 11:15:10,459 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 49 treesize of output 41 [2025-04-29 11:15:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648312433] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:10,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 45 [2025-04-29 11:15:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463327819] [2025-04-29 11:15:10,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:10,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-29 11:15:10,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:10,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-29 11:15:10,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1878, Unknown=0, NotChecked=0, Total=2070 [2025-04-29 11:15:10,518 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand has 46 states, 45 states have (on average 2.311111111111111) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 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:15:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:11,153 INFO L93 Difference]: Finished difference Result 162 states and 186 transitions. [2025-04-29 11:15:11,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:15:11,157 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.311111111111111) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 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 45 [2025-04-29 11:15:11,157 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:11,157 INFO L225 Difference]: With dead ends: 162 [2025-04-29 11:15:11,157 INFO L226 Difference]: Without dead ends: 162 [2025-04-29 11:15:11,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=298, Invalid=2458, Unknown=0, NotChecked=0, Total=2756 [2025-04-29 11:15:11,158 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 184 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:11,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 865 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:15:11,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-04-29 11:15:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 136. [2025-04-29 11:15:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 133 states have (on average 1.1729323308270676) internal successors, (156), 135 states have internal predecessors, (156), 0 states have call successors, (0), 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:15:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2025-04-29 11:15:11,163 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 45 [2025-04-29 11:15:11,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:11,163 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2025-04-29 11:15:11,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.311111111111111) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 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:15:11,163 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2025-04-29 11:15:11,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:15:11,165 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:11,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:11,172 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:15:11,365 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,SelfDestructingSolverStorable36 [2025-04-29 11:15:11,365 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:11,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:11,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1113614611, now seen corresponding path program 1 times [2025-04-29 11:15:11,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:11,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077827435] [2025-04-29 11:15:11,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:11,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:11,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:15:11,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:15:11,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:11,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:15:11,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:11,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077827435] [2025-04-29 11:15:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077827435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:11,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:11,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:15:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923847982] [2025-04-29 11:15:11,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:11,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:15:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:11,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:15:11,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:15:11,498 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:11,630 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2025-04-29 11:15:11,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:11,631 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-29 11:15:11,631 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:11,631 INFO L225 Difference]: With dead ends: 192 [2025-04-29 11:15:11,632 INFO L226 Difference]: Without dead ends: 168 [2025-04-29 11:15:11,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:15:11,632 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:11,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 360 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:15:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-04-29 11:15:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2025-04-29 11:15:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 161 states have (on average 1.1801242236024845) internal successors, (190), 163 states have internal predecessors, (190), 0 states have call successors, (0), 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:15:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 190 transitions. [2025-04-29 11:15:11,636 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 190 transitions. Word has length 45 [2025-04-29 11:15:11,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:11,636 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 190 transitions. [2025-04-29 11:15:11,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:11,636 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 190 transitions. [2025-04-29 11:15:11,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:15:11,638 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:11,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:11,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-29 11:15:11,638 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:11,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:11,638 INFO L85 PathProgramCache]: Analyzing trace with hash 308699780, now seen corresponding path program 1 times [2025-04-29 11:15:11,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:11,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803206559] [2025-04-29 11:15:11,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:11,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:11,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:15:11,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:15:11,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:11,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:11,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:11,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803206559] [2025-04-29 11:15:11,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803206559] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:11,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291642013] [2025-04-29 11:15:11,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:11,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:11,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:11,801 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:15:11,802 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:15:11,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:15:11,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:15:11,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:11,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:11,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:15:11,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:11,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:12,100 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:15:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:15:12,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291642013] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:12,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:12,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-04-29 11:15:12,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917275225] [2025-04-29 11:15:12,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:12,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:15:12,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:12,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:15:12,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:15:12,123 INFO L87 Difference]: Start difference. First operand 164 states and 190 transitions. Second operand has 23 states, 22 states have (on average 4.636363636363637) internal successors, (102), 23 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:15:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:12,367 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2025-04-29 11:15:12,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:15:12,367 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.636363636363637) internal successors, (102), 23 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 46 [2025-04-29 11:15:12,367 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:12,368 INFO L225 Difference]: With dead ends: 261 [2025-04-29 11:15:12,368 INFO L226 Difference]: Without dead ends: 261 [2025-04-29 11:15:12,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:15:12,368 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 167 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:12,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 733 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:15:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-04-29 11:15:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 214. [2025-04-29 11:15:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 211 states have (on average 1.1943127962085307) internal successors, (252), 213 states have internal predecessors, (252), 0 states have call successors, (0), 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:15:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 252 transitions. [2025-04-29 11:15:12,372 INFO L79 Accepts]: Start accepts. Automaton has 214 states and 252 transitions. Word has length 46 [2025-04-29 11:15:12,372 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:12,372 INFO L485 AbstractCegarLoop]: Abstraction has 214 states and 252 transitions. [2025-04-29 11:15:12,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.636363636363637) internal successors, (102), 23 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:15:12,372 INFO L278 IsEmpty]: Start isEmpty. Operand 214 states and 252 transitions. [2025-04-29 11:15:12,372 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:15:12,372 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:12,372 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:12,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:12,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-29 11:15:12,573 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:12,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -754736369, now seen corresponding path program 2 times [2025-04-29 11:15:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:12,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639008514] [2025-04-29 11:15:12,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:12,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-04-29 11:15:12,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 51 statements. [2025-04-29 11:15:12,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:15:12,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-29 11:15:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:12,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639008514] [2025-04-29 11:15:12,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639008514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:12,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:12,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:15:12,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932657241] [2025-04-29 11:15:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:12,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:15:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:12,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:15:12,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:15:12,623 INFO L87 Difference]: Start difference. First operand 214 states and 252 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:12,640 INFO L93 Difference]: Finished difference Result 193 states and 225 transitions. [2025-04-29 11:15:12,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:15:12,641 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-04-29 11:15:12,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:12,641 INFO L225 Difference]: With dead ends: 193 [2025-04-29 11:15:12,641 INFO L226 Difference]: Without dead ends: 155 [2025-04-29 11:15:12,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:15:12,641 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 5 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:12,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 240 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:15:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-04-29 11:15:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2025-04-29 11:15:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 150 states have (on average 1.2) internal successors, (180), 152 states have internal predecessors, (180), 0 states have call successors, (0), 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:15:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 180 transitions. [2025-04-29 11:15:12,644 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 180 transitions. Word has length 51 [2025-04-29 11:15:12,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:12,644 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 180 transitions. [2025-04-29 11:15:12,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:12,644 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 180 transitions. [2025-04-29 11:15:12,644 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:15:12,644 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:12,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:12,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-29 11:15:12,644 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:12,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1356135410, now seen corresponding path program 1 times [2025-04-29 11:15:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:12,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206360436] [2025-04-29 11:15:12,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:12,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:15:12,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:15:12,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:12,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:12,716 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-29 11:15:12,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:12,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206360436] [2025-04-29 11:15:12,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206360436] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:12,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776890850] [2025-04-29 11:15:12,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:12,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:12,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:12,719 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:15:12,721 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:15:12,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:15:12,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:15:12,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:12,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:12,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-29 11:15:12,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:12,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:15:12,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:15:13,069 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 11:15:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:15:13,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:13,272 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 14 [2025-04-29 11:15:13,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:15:13,275 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 16 treesize of output 12 [2025-04-29 11:15:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:15:13,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776890850] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:13,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:13,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 18] total 35 [2025-04-29 11:15:13,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322569240] [2025-04-29 11:15:13,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:13,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-29 11:15:13,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:13,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-29 11:15:13,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 11:15:13,338 INFO L87 Difference]: Start difference. First operand 153 states and 180 transitions. Second operand has 35 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 0 states have call successors, (0), 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:15:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:13,903 INFO L93 Difference]: Finished difference Result 227 states and 258 transitions. [2025-04-29 11:15:13,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-29 11:15:13,904 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 0 states have call successors, (0), 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:15:13,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:13,904 INFO L225 Difference]: With dead ends: 227 [2025-04-29 11:15:13,904 INFO L226 Difference]: Without dead ends: 174 [2025-04-29 11:15:13,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=2511, Unknown=0, NotChecked=0, Total=2756 [2025-04-29 11:15:13,905 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 67 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:13,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 862 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:15:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-04-29 11:15:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 166. [2025-04-29 11:15:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 163 states have (on average 1.2024539877300613) internal successors, (196), 165 states have internal predecessors, (196), 0 states have call successors, (0), 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:15:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 196 transitions. [2025-04-29 11:15:13,909 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 196 transitions. Word has length 51 [2025-04-29 11:15:13,909 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:13,909 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 196 transitions. [2025-04-29 11:15:13,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 0 states have call successors, (0), 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:15:13,909 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 196 transitions. [2025-04-29 11:15:13,909 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:15:13,909 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:13,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:13,917 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:15:14,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:14,114 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:14,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1541276009, now seen corresponding path program 2 times [2025-04-29 11:15:14,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:14,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488647017] [2025-04-29 11:15:14,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:14,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:14,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-04-29 11:15:14,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:15:14,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:14,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:15:14,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:14,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488647017] [2025-04-29 11:15:14,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488647017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:14,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221500732] [2025-04-29 11:15:14,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:14,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:14,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:14,385 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:15:14,387 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:15:14,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-04-29 11:15:14,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:15:14,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:14,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:14,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-29 11:15:14,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:15:14,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:14,744 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 21 treesize of output 17 [2025-04-29 11:15:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:15:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221500732] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:14,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-04-29 11:15:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784445389] [2025-04-29 11:15:14,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:14,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:15:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:14,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:15:14,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:15:14,847 INFO L87 Difference]: Start difference. First operand 166 states and 196 transitions. Second operand has 27 states, 26 states have (on average 4.615384615384615) internal successors, (120), 27 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:15,093 INFO L93 Difference]: Finished difference Result 183 states and 213 transitions. [2025-04-29 11:15:15,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:15:15,093 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.615384615384615) internal successors, (120), 27 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-04-29 11:15:15,094 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:15,094 INFO L225 Difference]: With dead ends: 183 [2025-04-29 11:15:15,094 INFO L226 Difference]: Without dead ends: 183 [2025-04-29 11:15:15,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:15:15,095 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 133 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:15,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 435 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:15:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-29 11:15:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2025-04-29 11:15:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 167 states have (on average 1.2095808383233533) internal successors, (202), 169 states have internal predecessors, (202), 0 states have call successors, (0), 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:15:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 202 transitions. [2025-04-29 11:15:15,097 INFO L79 Accepts]: Start accepts. Automaton has 170 states and 202 transitions. Word has length 57 [2025-04-29 11:15:15,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:15,097 INFO L485 AbstractCegarLoop]: Abstraction has 170 states and 202 transitions. [2025-04-29 11:15:15,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.615384615384615) internal successors, (120), 27 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:15,097 INFO L278 IsEmpty]: Start isEmpty. Operand 170 states and 202 transitions. [2025-04-29 11:15:15,097 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:15:15,097 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:15,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:15,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:15,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:15,298 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:15,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1078584170, now seen corresponding path program 1 times [2025-04-29 11:15:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:15,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567168672] [2025-04-29 11:15:15,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:15,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:15:15,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:15:15,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:15,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:15:15,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:15,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567168672] [2025-04-29 11:15:15,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567168672] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:15,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39241867] [2025-04-29 11:15:15,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:15,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:15,580 INFO L229 MonitoredProcess]: Starting monitored process 26 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:15:15,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-29 11:15:15,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:15:15,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:15:15,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:15,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:15,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-29 11:15:15,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:15,770 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:15:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:15:15,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:15,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:15:15,844 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 16 treesize of output 12 [2025-04-29 11:15:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:15:15,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39241867] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:15,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:15,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 26 [2025-04-29 11:15:15,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330546552] [2025-04-29 11:15:15,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:15,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 11:15:15,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:15,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 11:15:15,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:15:15,892 INFO L87 Difference]: Start difference. First operand 170 states and 202 transitions. Second operand has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 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:15:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:16,092 INFO L93 Difference]: Finished difference Result 325 states and 379 transitions. [2025-04-29 11:15:16,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:15:16,092 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 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 57 [2025-04-29 11:15:16,092 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:16,093 INFO L225 Difference]: With dead ends: 325 [2025-04-29 11:15:16,093 INFO L226 Difference]: Without dead ends: 262 [2025-04-29 11:15:16,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:15:16,094 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 61 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:16,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1209 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:15:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-04-29 11:15:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2025-04-29 11:15:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 251 states have (on average 1.207171314741036) internal successors, (303), 253 states have internal predecessors, (303), 0 states have call successors, (0), 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:15:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 303 transitions. [2025-04-29 11:15:16,097 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 303 transitions. Word has length 57 [2025-04-29 11:15:16,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:16,097 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 303 transitions. [2025-04-29 11:15:16,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 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:15:16,097 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 303 transitions. [2025-04-29 11:15:16,097 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-29 11:15:16,097 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:16,097 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:16,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:16,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-04-29 11:15:16,298 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:16,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash -597470998, now seen corresponding path program 1 times [2025-04-29 11:15:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:16,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911211682] [2025-04-29 11:15:16,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:16,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:15:16,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:15:16,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:16,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:15:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:16,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911211682] [2025-04-29 11:15:16,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911211682] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:16,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358992738] [2025-04-29 11:15:16,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:16,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:16,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:16,497 INFO L229 MonitoredProcess]: Starting monitored process 27 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:15:16,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-29 11:15:16,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:15:16,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:15:16,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:16,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:16,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-29 11:15:16,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:15:16,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:16,856 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:15:16,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-04-29 11:15:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:15:16,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358992738] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:16,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:16,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-04-29 11:15:16,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196807712] [2025-04-29 11:15:16,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:16,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:15:16,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:16,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:15:16,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:15:16,951 INFO L87 Difference]: Start difference. First operand 254 states and 303 transitions. Second operand has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 31 states have internal predecessors, (124), 0 states have call successors, (0), 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:15:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:17,300 INFO L93 Difference]: Finished difference Result 333 states and 396 transitions. [2025-04-29 11:15:17,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:15:17,301 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 31 states have internal predecessors, (124), 0 states have call successors, (0), 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 59 [2025-04-29 11:15:17,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:17,302 INFO L225 Difference]: With dead ends: 333 [2025-04-29 11:15:17,302 INFO L226 Difference]: Without dead ends: 333 [2025-04-29 11:15:17,303 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=1667, Unknown=0, NotChecked=0, Total=1980 [2025-04-29 11:15:17,303 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 151 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:17,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 588 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:15:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-04-29 11:15:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 298. [2025-04-29 11:15:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 295 states have (on average 1.2372881355932204) internal successors, (365), 297 states have internal predecessors, (365), 0 states have call successors, (0), 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:15:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 365 transitions. [2025-04-29 11:15:17,307 INFO L79 Accepts]: Start accepts. Automaton has 298 states and 365 transitions. Word has length 59 [2025-04-29 11:15:17,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:17,308 INFO L485 AbstractCegarLoop]: Abstraction has 298 states and 365 transitions. [2025-04-29 11:15:17,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 31 states have internal predecessors, (124), 0 states have call successors, (0), 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:15:17,308 INFO L278 IsEmpty]: Start isEmpty. Operand 298 states and 365 transitions. [2025-04-29 11:15:17,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-04-29 11:15:17,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:17,308 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:17,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:17,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-29 11:15:17,513 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:17,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1921668084, now seen corresponding path program 2 times [2025-04-29 11:15:17,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:17,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982382390] [2025-04-29 11:15:17,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:17,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-04-29 11:15:17,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:15:17,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:17,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:15:17,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:17,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982382390] [2025-04-29 11:15:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982382390] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:17,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738134149] [2025-04-29 11:15:17,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:17,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:17,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:17,817 INFO L229 MonitoredProcess]: Starting monitored process 28 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:15:17,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-29 11:15:17,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-04-29 11:15:17,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:15:17,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:17,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:17,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-29 11:15:17,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:15:18,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:18,212 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:15:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:15:18,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738134149] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:18,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:18,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 30 [2025-04-29 11:15:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251220019] [2025-04-29 11:15:18,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:18,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:15:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:18,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:15:18,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:15:18,269 INFO L87 Difference]: Start difference. First operand 298 states and 365 transitions. Second operand has 31 states, 30 states have (on average 4.033333333333333) internal successors, (121), 31 states have internal predecessors, (121), 0 states have call successors, (0), 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:15:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:18,635 INFO L93 Difference]: Finished difference Result 425 states and 518 transitions. [2025-04-29 11:15:18,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:15:18,635 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.033333333333333) internal successors, (121), 31 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-04-29 11:15:18,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:18,636 INFO L225 Difference]: With dead ends: 425 [2025-04-29 11:15:18,636 INFO L226 Difference]: Without dead ends: 425 [2025-04-29 11:15:18,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2025-04-29 11:15:18,637 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 323 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:18,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 766 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:15:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-04-29 11:15:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 362. [2025-04-29 11:15:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 359 states have (on average 1.2479108635097493) internal successors, (448), 361 states have internal predecessors, (448), 0 states have call successors, (0), 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:15:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 448 transitions. [2025-04-29 11:15:18,641 INFO L79 Accepts]: Start accepts. Automaton has 362 states and 448 transitions. Word has length 60 [2025-04-29 11:15:18,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:18,641 INFO L485 AbstractCegarLoop]: Abstraction has 362 states and 448 transitions. [2025-04-29 11:15:18,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.033333333333333) internal successors, (121), 31 states have internal predecessors, (121), 0 states have call successors, (0), 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:15:18,641 INFO L278 IsEmpty]: Start isEmpty. Operand 362 states and 448 transitions. [2025-04-29 11:15:18,641 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-29 11:15:18,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:18,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:18,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:18,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:18,843 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:18,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1925995664, now seen corresponding path program 1 times [2025-04-29 11:15:18,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:18,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149088084] [2025-04-29 11:15:18,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:18,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:18,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:15:18,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:15:18,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:18,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:15:19,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:19,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149088084] [2025-04-29 11:15:19,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149088084] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:19,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384875476] [2025-04-29 11:15:19,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:19,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:19,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:19,148 INFO L229 MonitoredProcess]: Starting monitored process 29 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:15:19,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-29 11:15:19,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:15:19,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:15:19,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:19,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:19,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-04-29 11:15:19,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:19,359 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:15:19,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:15:19,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 11:15:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:15:19,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:19,859 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 14 [2025-04-29 11:15:19,862 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-29 11:15:19,863 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 16 treesize of output 12 [2025-04-29 11:15:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:15:19,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384875476] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:19,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:19,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 20] total 46 [2025-04-29 11:15:19,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66231816] [2025-04-29 11:15:19,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:19,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-29 11:15:19,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:19,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-29 11:15:19,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1925, Unknown=0, NotChecked=0, Total=2070 [2025-04-29 11:15:19,919 INFO L87 Difference]: Start difference. First operand 362 states and 448 transitions. Second operand has 46 states, 46 states have (on average 2.9130434782608696) internal successors, (134), 46 states have internal predecessors, (134), 0 states have call successors, (0), 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:15:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:20,430 INFO L93 Difference]: Finished difference Result 344 states and 420 transitions. [2025-04-29 11:15:20,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:15:20,430 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.9130434782608696) internal successors, (134), 46 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-04-29 11:15:20,430 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:20,431 INFO L225 Difference]: With dead ends: 344 [2025-04-29 11:15:20,431 INFO L226 Difference]: Without dead ends: 325 [2025-04-29 11:15:20,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=3282, Unknown=0, NotChecked=0, Total=3540 [2025-04-29 11:15:20,432 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 75 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:20,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1594 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:15:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-04-29 11:15:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2025-04-29 11:15:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 317 states have (on average 1.2302839116719242) internal successors, (390), 319 states have internal predecessors, (390), 0 states have call successors, (0), 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:15:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 390 transitions. [2025-04-29 11:15:20,435 INFO L79 Accepts]: Start accepts. Automaton has 320 states and 390 transitions. Word has length 62 [2025-04-29 11:15:20,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:20,435 INFO L485 AbstractCegarLoop]: Abstraction has 320 states and 390 transitions. [2025-04-29 11:15:20,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.9130434782608696) internal successors, (134), 46 states have internal predecessors, (134), 0 states have call successors, (0), 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:15:20,435 INFO L278 IsEmpty]: Start isEmpty. Operand 320 states and 390 transitions. [2025-04-29 11:15:20,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-29 11:15:20,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:20,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:20,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:20,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:20,637 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:20,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:20,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1731542316, now seen corresponding path program 1 times [2025-04-29 11:15:20,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:20,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85167136] [2025-04-29 11:15:20,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:20,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:15:20,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:15:20,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:20,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:15:20,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:20,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85167136] [2025-04-29 11:15:20,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85167136] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:20,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593505799] [2025-04-29 11:15:20,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:20,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:20,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:20,917 INFO L229 MonitoredProcess]: Starting monitored process 30 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:15:20,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-29 11:15:21,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:15:21,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:15:21,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:21,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:21,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-29 11:15:21,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:15:21,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:21,240 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:15:21,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-04-29 11:15:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:15:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593505799] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:21,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:21,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 28 [2025-04-29 11:15:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369977612] [2025-04-29 11:15:21,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:21,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 11:15:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:21,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 11:15:21,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:15:21,331 INFO L87 Difference]: Start difference. First operand 320 states and 390 transitions. Second operand has 29 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 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:15:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:21,724 INFO L93 Difference]: Finished difference Result 401 states and 478 transitions. [2025-04-29 11:15:21,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:15:21,725 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-04-29 11:15:21,725 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:21,726 INFO L225 Difference]: With dead ends: 401 [2025-04-29 11:15:21,726 INFO L226 Difference]: Without dead ends: 395 [2025-04-29 11:15:21,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1588, Unknown=0, NotChecked=0, Total=1892 [2025-04-29 11:15:21,726 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 223 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:21,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 748 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:15:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-04-29 11:15:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 324. [2025-04-29 11:15:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 321 states have (on average 1.233644859813084) internal successors, (396), 323 states have internal predecessors, (396), 0 states have call successors, (0), 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:15:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 396 transitions. [2025-04-29 11:15:21,730 INFO L79 Accepts]: Start accepts. Automaton has 324 states and 396 transitions. Word has length 63 [2025-04-29 11:15:21,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:21,730 INFO L485 AbstractCegarLoop]: Abstraction has 324 states and 396 transitions. [2025-04-29 11:15:21,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 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:15:21,730 INFO L278 IsEmpty]: Start isEmpty. Operand 324 states and 396 transitions. [2025-04-29 11:15:21,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-29 11:15:21,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:21,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:21,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-29 11:15:21,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:21,931 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:21,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2147215939, now seen corresponding path program 3 times [2025-04-29 11:15:21,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:21,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675903171] [2025-04-29 11:15:21,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:15:21,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:21,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 4 equivalence classes. [2025-04-29 11:15:21,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 58 of 64 statements. [2025-04-29 11:15:21,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:15:21,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:15:22,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:22,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675903171] [2025-04-29 11:15:22,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675903171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:22,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160300560] [2025-04-29 11:15:22,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:15:22,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:22,028 INFO L229 MonitoredProcess]: Starting monitored process 31 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:15:22,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-29 11:15:22,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 4 equivalence classes. [2025-04-29 11:15:22,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 58 of 64 statements. [2025-04-29 11:15:22,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:15:22,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:22,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 148 conjuncts are in the unsatisfiable core [2025-04-29 11:15:22,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:22,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:15:22,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:15:23,417 INFO L325 Elim1Store]: treesize reduction 8, result has 81.4 percent of original size [2025-04-29 11:15:23,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 59 [2025-04-29 11:15:23,560 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:15:23,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 32 [2025-04-29 11:15:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:15:23,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:25,374 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:15:25,375 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 36 [2025-04-29 11:15:25,448 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2025-04-29 11:15:25,458 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:15:25,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 60 [2025-04-29 11:15:25,463 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 15 treesize of output 11 [2025-04-29 11:15:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:15:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160300560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:25,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 31, 28] total 66 [2025-04-29 11:15:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542232256] [2025-04-29 11:15:25,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:25,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-29 11:15:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:25,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-29 11:15:25,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=3989, Unknown=0, NotChecked=0, Total=4290 [2025-04-29 11:15:25,603 INFO L87 Difference]: Start difference. First operand 324 states and 396 transitions. Second operand has 66 states, 66 states have (on average 2.272727272727273) internal successors, (150), 66 states have internal predecessors, (150), 0 states have call successors, (0), 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:15:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:30,385 INFO L93 Difference]: Finished difference Result 500 states and 587 transitions. [2025-04-29 11:15:30,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-04-29 11:15:30,386 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.272727272727273) internal successors, (150), 66 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-04-29 11:15:30,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:30,387 INFO L225 Difference]: With dead ends: 500 [2025-04-29 11:15:30,387 INFO L226 Difference]: Without dead ends: 476 [2025-04-29 11:15:30,389 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3146 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1492, Invalid=13270, Unknown=0, NotChecked=0, Total=14762 [2025-04-29 11:15:30,390 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 994 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 2481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:30,390 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1565 Invalid, 2481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-29 11:15:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-04-29 11:15:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 428. [2025-04-29 11:15:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 425 states have (on average 1.2258823529411764) internal successors, (521), 427 states have internal predecessors, (521), 0 states have call successors, (0), 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:15:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 521 transitions. [2025-04-29 11:15:30,394 INFO L79 Accepts]: Start accepts. Automaton has 428 states and 521 transitions. Word has length 64 [2025-04-29 11:15:30,394 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:30,394 INFO L485 AbstractCegarLoop]: Abstraction has 428 states and 521 transitions. [2025-04-29 11:15:30,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.272727272727273) internal successors, (150), 66 states have internal predecessors, (150), 0 states have call successors, (0), 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:15:30,395 INFO L278 IsEmpty]: Start isEmpty. Operand 428 states and 521 transitions. [2025-04-29 11:15:30,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-04-29 11:15:30,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:30,395 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:30,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-29 11:15:30,596 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-29 11:15:30,596 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:30,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1295076794, now seen corresponding path program 2 times [2025-04-29 11:15:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:30,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193222404] [2025-04-29 11:15:30,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:30,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-29 11:15:30,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:15:30,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:30,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:15:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:30,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193222404] [2025-04-29 11:15:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193222404] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:30,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390490281] [2025-04-29 11:15:30,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:30,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:30,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:30,831 INFO L229 MonitoredProcess]: Starting monitored process 32 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:15:30,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-29 11:15:30,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-29 11:15:30,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:15:30,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:15:30,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:30,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-29 11:15:30,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:15:31,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:31,256 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 21 treesize of output 17 [2025-04-29 11:15:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:15:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390490281] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:31,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2025-04-29 11:15:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632964739] [2025-04-29 11:15:31,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:31,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-29 11:15:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:31,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-29 11:15:31,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2025-04-29 11:15:31,358 INFO L87 Difference]: Start difference. First operand 428 states and 521 transitions. Second operand has 32 states, 31 states have (on average 4.483870967741935) internal successors, (139), 32 states have internal predecessors, (139), 0 states have call successors, (0), 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:15:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:15:31,716 INFO L93 Difference]: Finished difference Result 452 states and 537 transitions. [2025-04-29 11:15:31,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:15:31,716 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.483870967741935) internal successors, (139), 32 states have internal predecessors, (139), 0 states have call successors, (0), 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:15:31,716 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:15:31,717 INFO L225 Difference]: With dead ends: 452 [2025-04-29 11:15:31,717 INFO L226 Difference]: Without dead ends: 452 [2025-04-29 11:15:31,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2025-04-29 11:15:31,718 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 128 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:15:31,718 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1060 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:15:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-04-29 11:15:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 428. [2025-04-29 11:15:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 425 states have (on average 1.2211764705882353) internal successors, (519), 427 states have internal predecessors, (519), 0 states have call successors, (0), 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:15:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 519 transitions. [2025-04-29 11:15:31,722 INFO L79 Accepts]: Start accepts. Automaton has 428 states and 519 transitions. Word has length 65 [2025-04-29 11:15:31,722 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:15:31,722 INFO L485 AbstractCegarLoop]: Abstraction has 428 states and 519 transitions. [2025-04-29 11:15:31,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.483870967741935) internal successors, (139), 32 states have internal predecessors, (139), 0 states have call successors, (0), 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:15:31,722 INFO L278 IsEmpty]: Start isEmpty. Operand 428 states and 519 transitions. [2025-04-29 11:15:31,723 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-04-29 11:15:31,723 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:15:31,723 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:31,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:31,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-29 11:15:31,923 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-04-29 11:15:31,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:31,924 INFO L85 PathProgramCache]: Analyzing trace with hash 265099167, now seen corresponding path program 3 times [2025-04-29 11:15:31,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:31,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260298077] [2025-04-29 11:15:31,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:15:31,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:31,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 5 equivalence classes. [2025-04-29 11:15:31,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 62 of 65 statements. [2025-04-29 11:15:31,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:15:31,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:15:33,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:33,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260298077] [2025-04-29 11:15:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260298077] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:33,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298638953] [2025-04-29 11:15:33,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:15:33,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:33,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:33,107 INFO L229 MonitoredProcess]: Starting monitored process 33 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:15:33,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-29 11:15:33,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 5 equivalence classes. [2025-04-29 11:15:33,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 62 of 65 statements. [2025-04-29 11:15:33,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:15:33,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:33,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 109 conjuncts are in the unsatisfiable core [2025-04-29 11:15:33,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:33,393 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:15:33,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:15:33,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:15:33,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-29 11:15:33,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:15:33,666 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:15:35,560 INFO L325 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-04-29 11:15:35,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2025-04-29 11:15:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 11:15:35,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:37,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2025-04-29 11:15:37,723 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:15:37,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 154 Killed by 15