./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/diff-alloca-2.i --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/diff-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5cc33a4b6801f9f06dbbb17ff694aba4439c76c6a2b62ec290c2132cc01ea0fe --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:33:09,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:33:09,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:33:09,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:33:09,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:33:09,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:33:09,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:33:09,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:33:09,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:33:09,834 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:33:09,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:33:09,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:33:09,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:33:09,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:33:09,835 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:33:09,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:33:09,835 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:33:09,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:33:09,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:33:09,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:33:09,835 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:33:09,835 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:33:09,835 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:33:09,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:33:09,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:33:09,836 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:33:09,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:33:09,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:33:09,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:33:09,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:33:09,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:33:09,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:33:09,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:33:09,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:09,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:33:09,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:33:09,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:33:09,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:33:09,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:09,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:33:09,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:33:09,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:33:09,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:33:09,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:33:09,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:33:09,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:33:09,837 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 -> 5cc33a4b6801f9f06dbbb17ff694aba4439c76c6a2b62ec290c2132cc01ea0fe [2025-04-30 10:33:10,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:33:10,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:33:10,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:33:10,076 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:33:10,076 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:33:10,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/diff-alloca-2.i [2025-04-30 10:33:11,374 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39468ebf6/21a65eb089ff4cbdaae2f98e24d063ae/FLAGb22cd72d5 [2025-04-30 10:33:11,626 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:33:11,627 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/diff-alloca-2.i [2025-04-30 10:33:11,645 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39468ebf6/21a65eb089ff4cbdaae2f98e24d063ae/FLAGb22cd72d5 [2025-04-30 10:33:12,424 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39468ebf6/21a65eb089ff4cbdaae2f98e24d063ae [2025-04-30 10:33:12,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:33:12,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:33:12,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:33:12,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:33:12,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:33:12,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d4ab1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12, skipping insertion in model container [2025-04-30 10:33:12,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:33:12,700 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-30 10:33:12,701 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-30 10:33:12,701 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-30 10:33:12,704 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:33:12,712 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:33:12,754 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:33:12,775 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:33:12,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12 WrapperNode [2025-04-30 10:33:12,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:33:12,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:33:12,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:33:12,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:33:12,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,808 INFO L138 Inliner]: procedures = 116, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2025-04-30 10:33:12,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:33:12,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:33:12,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:33:12,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:33:12,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,831 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 3, 1]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 3 writes are split as follows [1, 1, 1]. [2025-04-30 10:33:12,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:33:12,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:33:12,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:33:12,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:33:12,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (1/1) ... [2025-04-30 10:33:12,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:12,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:12,876 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-30 10:33:12,880 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-30 10:33:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:33:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:33:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:33:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:33:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:33:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:33:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:33:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:33:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:33:12,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:33:12,977 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:33:12,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:33:13,137 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-04-30 10:33:13,137 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:33:13,145 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:33:13,145 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:33:13,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:13 BoogieIcfgContainer [2025-04-30 10:33:13,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:33:13,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:33:13,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:33:13,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:33:13,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:33:12" (1/3) ... [2025-04-30 10:33:13,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cfdbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:33:13, skipping insertion in model container [2025-04-30 10:33:13,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:12" (2/3) ... [2025-04-30 10:33:13,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cfdbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:33:13, skipping insertion in model container [2025-04-30 10:33:13,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:13" (3/3) ... [2025-04-30 10:33:13,156 INFO L128 eAbstractionObserver]: Analyzing ICFG diff-alloca-2.i [2025-04-30 10:33:13,167 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:33:13,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG diff-alloca-2.i that has 1 procedures, 38 locations, 45 edges, 1 initial locations, 4 loop locations, and 13 error locations. [2025-04-30 10:33:13,199 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:33:13,207 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;@1a73d63e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:33:13,207 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-30 10:33:13,210 INFO L278 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.875) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-30 10:33:13,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:13,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:13,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:13,215 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:13,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-30 10:33:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:13,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286455551] [2025-04-30 10:33:13,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:13,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:13,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:13,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:13,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:13,509 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-30 10:33:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:13,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286455551] [2025-04-30 10:33:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286455551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:13,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:13,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:33:13,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394109695] [2025-04-30 10:33:13,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:13,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:33:13,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:13,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:33:13,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:33:13,532 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.875) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 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-30 10:33:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:13,575 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-04-30 10:33:13,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:33:13,577 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-30 10:33:13,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:13,581 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:33:13,582 INFO L226 Difference]: Without dead ends: 35 [2025-04-30 10:33:13,583 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-30 10:33:13,586 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:13,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-30 10:33:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-30 10:33:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.826086956521739) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-04-30 10:33:13,612 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 7 [2025-04-30 10:33:13,613 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:13,613 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-04-30 10:33:13,613 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-30 10:33:13,613 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-04-30 10:33:13,613 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:13,613 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:13,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:13,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:33:13,626 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:13,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028969, now seen corresponding path program 1 times [2025-04-30 10:33:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:13,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661646653] [2025-04-30 10:33:13,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:13,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:13,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:13,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:13,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:13,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:13,948 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-30 10:33:13,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:13,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661646653] [2025-04-30 10:33:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661646653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072866018] [2025-04-30 10:33:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:13,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:13,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:13,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:13,950 INFO L87 Difference]: Start difference. First operand 35 states and 42 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-30 10:33:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:14,046 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-04-30 10:33:14,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:14,047 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-30 10:33:14,047 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:14,047 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:33:14,047 INFO L226 Difference]: Without dead ends: 49 [2025-04-30 10:33:14,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:14,048 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:14,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-30 10:33:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2025-04-30 10:33:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-04-30 10:33:14,052 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 7 [2025-04-30 10:33:14,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:14,052 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-04-30 10:33:14,052 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-30 10:33:14,052 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-04-30 10:33:14,052 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:14,052 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:14,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:14,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:33:14,052 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:14,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876011, now seen corresponding path program 1 times [2025-04-30 10:33:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:14,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592837852] [2025-04-30 10:33:14,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:14,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:14,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:14,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:14,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:14,308 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-30 10:33:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:14,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592837852] [2025-04-30 10:33:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592837852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:14,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:14,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:14,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886269156] [2025-04-30 10:33:14,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:14,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:14,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:14,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:14,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:14,312 INFO L87 Difference]: Start difference. First operand 39 states and 47 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-30 10:33:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:14,387 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-04-30 10:33:14,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:14,388 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-30 10:33:14,388 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:14,389 INFO L225 Difference]: With dead ends: 42 [2025-04-30 10:33:14,389 INFO L226 Difference]: Without dead ends: 42 [2025-04-30 10:33:14,390 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:14,390 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:14,391 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 111 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-30 10:33:14,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2025-04-30 10:33:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.76) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-04-30 10:33:14,396 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 7 [2025-04-30 10:33:14,396 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:14,397 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-04-30 10:33:14,397 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-30 10:33:14,397 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-04-30 10:33:14,397 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:33:14,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:14,397 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:14,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:33:14,398 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:14,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash 627432691, now seen corresponding path program 1 times [2025-04-30 10:33:14,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:14,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676003924] [2025-04-30 10:33:14,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:14,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:14,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:14,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:14,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:14,462 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-30 10:33:14,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:14,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676003924] [2025-04-30 10:33:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676003924] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:14,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986456826] [2025-04-30 10:33:14,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:14,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:14,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:14,464 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-30 10:33:14,466 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-30 10:33:14,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:14,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:14,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:14,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:14,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:33:14,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:14,579 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-30 10:33:14,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:33:14,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986456826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:14,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:33:14,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:33:14,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575524049] [2025-04-30 10:33:14,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:14,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:14,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:14,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:14,583 INFO L87 Difference]: Start difference. First operand 37 states and 44 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-30 10:33:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:14,608 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-04-30 10:33:14,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:14,609 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-30 10:33:14,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:14,610 INFO L225 Difference]: With dead ends: 48 [2025-04-30 10:33:14,610 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:33:14,611 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-30 10:33:14,612 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:14,612 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:33:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2025-04-30 10:33:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 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-30 10:33:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-04-30 10:33:14,616 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 10 [2025-04-30 10:33:14,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:14,616 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-04-30 10:33:14,616 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-30 10:33:14,616 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-04-30 10:33:14,617 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:33:14,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:14,619 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:14,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:14,825 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-30 10:33:14,825 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:14,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:14,825 INFO L85 PathProgramCache]: Analyzing trace with hash -181913935, now seen corresponding path program 1 times [2025-04-30 10:33:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:14,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830358895] [2025-04-30 10:33:14,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:14,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:14,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:14,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:14,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:15,123 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-30 10:33:15,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:15,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830358895] [2025-04-30 10:33:15,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830358895] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:15,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434912041] [2025-04-30 10:33:15,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:15,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:15,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:15,127 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-30 10:33:15,128 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-30 10:33:15,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:15,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:15,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:15,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:15,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-30 10:33:15,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:15,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:15,270 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 15 treesize of output 9 [2025-04-30 10:33:15,280 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-30 10:33:15,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:15,325 INFO L325 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2025-04-30 10:33:15,326 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2025-04-30 10:33:15,334 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-30 10:33:15,465 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-30 10:33:15,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:15,609 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:33:15,615 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-30 10:33:15,657 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-30 10:33:15,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434912041] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:15,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:15,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-04-30 10:33:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577329469] [2025-04-30 10:33:15,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:15,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:33:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:15,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:33:15,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:33:15,659 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-30 10:33:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:15,803 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-04-30 10:33:15,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:15,804 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 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-30 10:33:15,804 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:15,805 INFO L225 Difference]: With dead ends: 43 [2025-04-30 10:33:15,805 INFO L226 Difference]: Without dead ends: 43 [2025-04-30 10:33:15,805 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:33:15,806 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:15,807 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 184 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-30 10:33:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-04-30 10:33:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 40 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-30 10:33:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-04-30 10:33:15,809 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 10 [2025-04-30 10:33:15,809 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:15,809 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-04-30 10:33:15,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-30 10:33:15,812 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-04-30 10:33:15,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:33:15,813 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:15,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:15,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:16,017 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-30 10:33:16,017 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:16,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:16,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2024417044, now seen corresponding path program 1 times [2025-04-30 10:33:16,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:16,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563561949] [2025-04-30 10:33:16,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:16,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:16,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:16,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:16,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:16,166 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-30 10:33:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:16,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563561949] [2025-04-30 10:33:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563561949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:16,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764847882] [2025-04-30 10:33:16,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:16,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:16,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:16,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:16,168 INFO L87 Difference]: Start difference. First operand 41 states and 49 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-30 10:33:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:16,220 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-04-30 10:33:16,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:16,221 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-30 10:33:16,221 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:16,221 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:33:16,221 INFO L226 Difference]: Without dead ends: 59 [2025-04-30 10:33:16,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:16,223 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:16,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 95 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-30 10:33:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2025-04-30 10:33:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.5) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-30 10:33:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-04-30 10:33:16,229 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 11 [2025-04-30 10:33:16,229 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:16,229 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-04-30 10:33:16,229 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-30 10:33:16,229 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-04-30 10:33:16,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:33:16,230 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:16,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:16,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:33:16,230 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:16,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:16,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2024417045, now seen corresponding path program 1 times [2025-04-30 10:33:16,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:16,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693532878] [2025-04-30 10:33:16,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:16,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:16,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:16,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:16,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:16,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:16,284 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-30 10:33:16,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:16,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693532878] [2025-04-30 10:33:16,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693532878] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:16,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:16,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:33:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212227199] [2025-04-30 10:33:16,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:16,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:33:16,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:16,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:33:16,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:33:16,286 INFO L87 Difference]: Start difference. First operand 53 states and 63 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-30 10:33:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:16,304 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-04-30 10:33:16,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:33:16,305 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-30 10:33:16,305 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:16,305 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:33:16,305 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:33:16,307 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-30 10:33:16,307 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:16,307 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:16,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:33:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-30 10:33:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-04-30 10:33:16,310 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 11 [2025-04-30 10:33:16,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:16,310 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-04-30 10:33:16,310 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-30 10:33:16,310 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-04-30 10:33:16,310 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:33:16,310 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:16,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:16,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:33:16,311 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:16,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:16,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1461203626, now seen corresponding path program 1 times [2025-04-30 10:33:16,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:16,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881175763] [2025-04-30 10:33:16,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:16,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:16,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:16,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:16,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:16,494 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-30 10:33:16,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:16,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881175763] [2025-04-30 10:33:16,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881175763] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:16,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:16,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:33:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616232663] [2025-04-30 10:33:16,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:16,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:33:16,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:16,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:33:16,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:16,496 INFO L87 Difference]: Start difference. First operand 52 states and 61 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-30 10:33:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:16,532 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2025-04-30 10:33:16,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:33:16,532 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-30 10:33:16,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:16,533 INFO L225 Difference]: With dead ends: 55 [2025-04-30 10:33:16,533 INFO L226 Difference]: Without dead ends: 55 [2025-04-30 10:33:16,533 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-30 10:33:16,534 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:16,534 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-30 10:33:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2025-04-30 10:33:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.5625) internal successors, (50), 41 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-30 10:33:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-04-30 10:33:16,536 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 11 [2025-04-30 10:33:16,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:16,536 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-04-30 10:33:16,536 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-30 10:33:16,537 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-04-30 10:33:16,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:33:16,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:16,537 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:16,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:33:16,537 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:16,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash 522585690, now seen corresponding path program 1 times [2025-04-30 10:33:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:16,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212351853] [2025-04-30 10:33:16,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:16,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:33:16,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:33:16,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:16,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:16,582 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-30 10:33:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:16,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212351853] [2025-04-30 10:33:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212351853] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:16,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726365089] [2025-04-30 10:33:16,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:16,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:16,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:16,585 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-30 10:33:16,586 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-30 10:33:16,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:33:16,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:33:16,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:16,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:16,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:33:16,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:16,663 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-30 10:33:16,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:33:16,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726365089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:16,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:33:16,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:33:16,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592704613] [2025-04-30 10:33:16,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:16,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:16,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:16,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:16,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:16,665 INFO L87 Difference]: Start difference. First operand 42 states and 50 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-30 10:33:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:16,683 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-04-30 10:33:16,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:16,683 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-30 10:33:16,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:16,684 INFO L225 Difference]: With dead ends: 56 [2025-04-30 10:33:16,684 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:33:16,684 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-30 10:33:16,684 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:16,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:16,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:33:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-30 10:33:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 55 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-30 10:33:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-04-30 10:33:16,687 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 14 [2025-04-30 10:33:16,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:16,688 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-04-30 10:33:16,688 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-30 10:33:16,688 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-04-30 10:33:16,688 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:33:16,688 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:16,688 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:16,694 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-30 10:33:16,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:16,893 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:16,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:16,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1223650268, now seen corresponding path program 1 times [2025-04-30 10:33:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:16,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33987928] [2025-04-30 10:33:16,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:16,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:33:16,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:33:16,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:16,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:17,153 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-30 10:33:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:17,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33987928] [2025-04-30 10:33:17,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33987928] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:17,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915868013] [2025-04-30 10:33:17,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:17,158 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-30 10:33:17,159 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-30 10:33:17,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:33:17,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:33:17,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:17,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:17,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:33:17,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:17,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:17,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2025-04-30 10:33:17,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:17,269 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-04-30 10:33:17,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:17,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:17,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 10:33:17,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:17,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:17,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-30 10:33:17,574 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-30 10:33:17,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:17,750 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:33:17,805 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-30 10:33:17,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915868013] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:17,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:17,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-04-30 10:33:17,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402096432] [2025-04-30 10:33:17,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:17,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:33:17,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:17,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:33:17,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:33:17,807 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:17,978 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-04-30 10:33:17,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:33:17,978 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:33:17,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:17,979 INFO L225 Difference]: With dead ends: 56 [2025-04-30 10:33:17,979 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:33:17,979 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:33:17,979 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:17,980 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 169 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:33:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-04-30 10:33:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.4) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-30 10:33:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-04-30 10:33:17,982 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 14 [2025-04-30 10:33:17,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:17,982 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-04-30 10:33:17,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:17,982 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-04-30 10:33:17,982 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:33:17,982 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:17,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:17,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:33:18,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:18,185 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:18,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash -306138691, now seen corresponding path program 1 times [2025-04-30 10:33:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:18,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811998661] [2025-04-30 10:33:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:18,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:18,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:18,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:18,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:18,231 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-30 10:33:18,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:18,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811998661] [2025-04-30 10:33:18,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811998661] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:18,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:18,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131704914] [2025-04-30 10:33:18,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:18,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:18,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:18,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:18,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:18,233 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:18,258 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-04-30 10:33:18,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:18,258 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:33:18,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:18,259 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:33:18,260 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:33:18,261 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-30 10:33:18,261 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:18,261 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 50 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:33:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-30 10:33:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-04-30 10:33:18,267 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 16 [2025-04-30 10:33:18,267 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:18,267 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-04-30 10:33:18,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:18,267 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-04-30 10:33:18,267 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:33:18,267 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:18,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:18,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:33:18,267 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:18,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash -306138690, now seen corresponding path program 1 times [2025-04-30 10:33:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:18,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199074615] [2025-04-30 10:33:18,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:18,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:18,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:18,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:18,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:18,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:18,364 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-30 10:33:18,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:18,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199074615] [2025-04-30 10:33:18,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199074615] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:18,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244270584] [2025-04-30 10:33:18,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:18,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:18,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:18,367 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-30 10:33:18,369 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-30 10:33:18,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:18,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:18,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:18,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:18,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:33:18,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:18,494 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-30 10:33:18,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:18,535 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-30 10:33:18,542 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-30 10:33:18,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244270584] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:18,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:18,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-04-30 10:33:18,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411227083] [2025-04-30 10:33:18,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:18,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:33:18,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:18,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:33:18,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:33:18,544 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 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-30 10:33:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:18,615 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2025-04-30 10:33:18,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:18,616 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 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 16 [2025-04-30 10:33:18,616 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:18,616 INFO L225 Difference]: With dead ends: 75 [2025-04-30 10:33:18,616 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:33:18,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:33:18,617 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:18,617 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 127 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:33:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2025-04-30 10:33:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.38) internal successors, (69), 56 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-30 10:33:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-04-30 10:33:18,619 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 16 [2025-04-30 10:33:18,619 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:18,619 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-04-30 10:33:18,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 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-30 10:33:18,619 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-04-30 10:33:18,619 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:33:18,619 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:18,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:18,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:33:18,824 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-30 10:33:18,824 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:18,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash -306104993, now seen corresponding path program 1 times [2025-04-30 10:33:18,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:18,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742466872] [2025-04-30 10:33:18,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:18,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:18,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:18,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:18,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:18,863 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-30 10:33:18,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:18,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742466872] [2025-04-30 10:33:18,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742466872] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:18,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:18,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:18,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868840058] [2025-04-30 10:33:18,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:18,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:18,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:18,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:18,864 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:18,887 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2025-04-30 10:33:18,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:18,887 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:33:18,887 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:18,888 INFO L225 Difference]: With dead ends: 70 [2025-04-30 10:33:18,888 INFO L226 Difference]: Without dead ends: 70 [2025-04-30 10:33:18,889 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-30 10:33:18,889 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:18,889 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-30 10:33:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2025-04-30 10:33:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.36) internal successors, (68), 56 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-30 10:33:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-04-30 10:33:18,891 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 16 [2025-04-30 10:33:18,891 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:18,891 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-04-30 10:33:18,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:18,891 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-04-30 10:33:18,894 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:33:18,894 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:18,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:18,895 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:33:18,895 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:18,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash -900364812, now seen corresponding path program 1 times [2025-04-30 10:33:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:18,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866158174] [2025-04-30 10:33:18,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:18,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:33:18,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:33:18,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:18,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:18,929 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-30 10:33:18,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:18,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866158174] [2025-04-30 10:33:18,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866158174] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:18,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:18,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:18,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401936119] [2025-04-30 10:33:18,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:18,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:18,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:18,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:18,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:18,932 INFO L87 Difference]: Start difference. First operand 57 states and 68 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-30 10:33:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:18,951 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-04-30 10:33:18,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:18,951 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-30 10:33:18,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:18,952 INFO L225 Difference]: With dead ends: 56 [2025-04-30 10:33:18,952 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:33:18,952 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-30 10:33:18,952 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:18,953 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:33:18,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-30 10:33:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.34) internal successors, (67), 55 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-30 10:33:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-04-30 10:33:18,954 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 17 [2025-04-30 10:33:18,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:18,954 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-04-30 10:33:18,954 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-30 10:33:18,955 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-04-30 10:33:18,955 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:33:18,955 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:18,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:18,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:33:18,955 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:18,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:18,955 INFO L85 PathProgramCache]: Analyzing trace with hash -900364811, now seen corresponding path program 1 times [2025-04-30 10:33:18,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:18,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778388664] [2025-04-30 10:33:18,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:18,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:18,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:33:18,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:33:18,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:18,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:19,042 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-30 10:33:19,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:19,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778388664] [2025-04-30 10:33:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778388664] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:19,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188837013] [2025-04-30 10:33:19,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:19,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:19,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:19,045 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-30 10:33:19,046 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-30 10:33:19,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:33:19,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:33:19,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:19,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:19,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:33:19,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:19,182 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-30 10:33:19,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:19,216 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-30 10:33:19,231 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-30 10:33:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188837013] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:19,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:19,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-04-30 10:33:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991779372] [2025-04-30 10:33:19,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:19,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:33:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:19,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:33:19,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:33:19,233 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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-30 10:33:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:19,336 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-04-30 10:33:19,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:33:19,336 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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 17 [2025-04-30 10:33:19,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:19,336 INFO L225 Difference]: With dead ends: 65 [2025-04-30 10:33:19,337 INFO L226 Difference]: Without dead ends: 65 [2025-04-30 10:33:19,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:33:19,338 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:19,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 138 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-30 10:33:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2025-04-30 10:33:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2025-04-30 10:33:19,340 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 17 [2025-04-30 10:33:19,340 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:19,340 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2025-04-30 10:33:19,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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-30 10:33:19,340 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2025-04-30 10:33:19,341 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:33:19,341 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:19,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:19,353 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-30 10:33:19,544 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-30 10:33:19,544 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:19,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2141072478, now seen corresponding path program 1 times [2025-04-30 10:33:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:19,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613059708] [2025-04-30 10:33:19,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:19,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:33:19,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:33:19,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:19,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:19,610 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-30 10:33:19,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:19,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613059708] [2025-04-30 10:33:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613059708] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:19,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:19,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178873299] [2025-04-30 10:33:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:19,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:19,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:19,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:19,611 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-30 10:33:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:19,631 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-04-30 10:33:19,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:19,631 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-30 10:33:19,632 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:19,632 INFO L225 Difference]: With dead ends: 58 [2025-04-30 10:33:19,632 INFO L226 Difference]: Without dead ends: 58 [2025-04-30 10:33:19,632 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-30 10:33:19,632 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:19,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 52 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-30 10:33:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-04-30 10:33:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.320754716981132) internal successors, (70), 57 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-30 10:33:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-04-30 10:33:19,637 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 18 [2025-04-30 10:33:19,638 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:19,638 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-04-30 10:33:19,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-30 10:33:19,638 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2025-04-30 10:33:19,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:33:19,638 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:19,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:19,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:33:19,638 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:19,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:19,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2141072477, now seen corresponding path program 1 times [2025-04-30 10:33:19,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:19,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520673360] [2025-04-30 10:33:19,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:19,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:33:19,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:33:19,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:19,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:19,702 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-30 10:33:19,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:19,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520673360] [2025-04-30 10:33:19,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520673360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:19,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:19,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:19,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787391070] [2025-04-30 10:33:19,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:19,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:19,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:19,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:19,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:19,704 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-30 10:33:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:19,728 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-04-30 10:33:19,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:19,728 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-04-30 10:33:19,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:19,728 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:33:19,729 INFO L226 Difference]: Without dead ends: 59 [2025-04-30 10:33:19,729 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:19,729 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:19,730 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 64 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:19,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-30 10:33:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2025-04-30 10:33:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-30 10:33:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-04-30 10:33:19,733 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 18 [2025-04-30 10:33:19,733 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:19,733 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-04-30 10:33:19,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-30 10:33:19,734 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-04-30 10:33:19,734 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:33:19,734 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:19,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:19,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:33:19,734 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:19,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash -142309523, now seen corresponding path program 1 times [2025-04-30 10:33:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:19,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027080944] [2025-04-30 10:33:19,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:19,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:33:19,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:33:19,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:19,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:19,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:19,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027080944] [2025-04-30 10:33:19,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027080944] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:19,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869308339] [2025-04-30 10:33:19,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:19,790 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-30 10:33:19,791 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-30 10:33:19,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:33:19,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:33:19,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:19,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:19,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:33:19,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:19,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:33:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869308339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:19,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:33:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-04-30 10:33:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862807187] [2025-04-30 10:33:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:19,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:19,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:19,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:19,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:33:19,888 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:19,914 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-04-30 10:33:19,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:33:19,914 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-30 10:33:19,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:19,914 INFO L225 Difference]: With dead ends: 74 [2025-04-30 10:33:19,914 INFO L226 Difference]: Without dead ends: 74 [2025-04-30 10:33:19,914 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:33:19,915 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:19,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:19,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-30 10:33:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2025-04-30 10:33:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 70 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2025-04-30 10:33:19,917 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 21 [2025-04-30 10:33:19,917 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:19,917 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2025-04-30 10:33:19,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:19,917 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2025-04-30 10:33:19,917 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:33:19,917 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:19,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:19,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:33:20,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:20,118 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:20,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:20,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2136454229, now seen corresponding path program 1 times [2025-04-30 10:33:20,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:20,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153388192] [2025-04-30 10:33:20,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:20,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:20,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:33:20,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:33:20,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:20,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:20,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:20,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153388192] [2025-04-30 10:33:20,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153388192] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:20,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935532366] [2025-04-30 10:33:20,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:20,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:20,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:20,179 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-30 10:33:20,179 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-30 10:33:20,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:33:20,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:33:20,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:20,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:20,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:33:20,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:20,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935532366] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:20,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:20,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-04-30 10:33:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145213576] [2025-04-30 10:33:20,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:20,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:33:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:20,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:33:20,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:33:20,307 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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-30 10:33:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:20,349 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2025-04-30 10:33:20,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:33:20,350 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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 21 [2025-04-30 10:33:20,350 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:20,350 INFO L225 Difference]: With dead ends: 94 [2025-04-30 10:33:20,350 INFO L226 Difference]: Without dead ends: 94 [2025-04-30 10:33:20,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:33:20,351 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:20,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 152 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-30 10:33:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2025-04-30 10:33:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.3) internal successors, (91), 73 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-30 10:33:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2025-04-30 10:33:20,352 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 21 [2025-04-30 10:33:20,352 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:20,352 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2025-04-30 10:33:20,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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-30 10:33:20,353 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2025-04-30 10:33:20,353 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:33:20,353 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:20,353 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-30 10:33:20,361 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-30 10:33:20,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:20,556 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:20,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash -118042071, now seen corresponding path program 1 times [2025-04-30 10:33:20,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:20,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486277630] [2025-04-30 10:33:20,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:20,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:20,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:33:20,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:33:20,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:20,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:20,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:20,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486277630] [2025-04-30 10:33:20,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486277630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:20,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:20,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:20,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839493793] [2025-04-30 10:33:20,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:20,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:20,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:20,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:20,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:20,583 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 4 states, 4 states have (on average 5.5) 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-30 10:33:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:20,600 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2025-04-30 10:33:20,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:20,601 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) 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-30 10:33:20,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:20,601 INFO L225 Difference]: With dead ends: 76 [2025-04-30 10:33:20,601 INFO L226 Difference]: Without dead ends: 76 [2025-04-30 10:33:20,601 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:20,602 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 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-30 10:33:20,602 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-30 10:33:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-04-30 10:33:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 75 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-30 10:33:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2025-04-30 10:33:20,603 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 22 [2025-04-30 10:33:20,604 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:20,604 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2025-04-30 10:33:20,604 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) 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-30 10:33:20,604 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2025-04-30 10:33:20,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:33:20,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:20,604 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-30 10:33:20,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:33:20,604 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:20,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash -116195029, now seen corresponding path program 1 times [2025-04-30 10:33:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:20,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988807541] [2025-04-30 10:33:20,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:20,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:20,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:33:20,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:33:20,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:20,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:20,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:20,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988807541] [2025-04-30 10:33:20,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988807541] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:20,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940136613] [2025-04-30 10:33:20,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:20,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:20,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:20,815 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-30 10:33:20,816 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-30 10:33:20,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:33:20,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:33:20,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:20,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:20,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-30 10:33:20,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:20,925 INFO L325 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-04-30 10:33:20,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2025-04-30 10:33:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:21,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940136613] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:21,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:33:21,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 7] total 17 [2025-04-30 10:33:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948247432] [2025-04-30 10:33:21,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:21,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:33:21,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:21,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:33:21,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:33:21,286 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-30 10:33:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:21,352 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2025-04-30 10:33:21,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:21,352 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-30 10:33:21,353 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:21,353 INFO L225 Difference]: With dead ends: 122 [2025-04-30 10:33:21,353 INFO L226 Difference]: Without dead ends: 122 [2025-04-30 10:33:21,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:33:21,354 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:21,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 116 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-30 10:33:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2025-04-30 10:33:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.2695652173913043) internal successors, (146), 118 states have internal predecessors, (146), 0 states have call successors, (0), 0 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-30 10:33:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2025-04-30 10:33:21,356 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 22 [2025-04-30 10:33:21,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:21,356 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2025-04-30 10:33:21,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-30 10:33:21,356 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2025-04-30 10:33:21,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:33:21,359 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:21,359 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-30 10:33:21,365 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-30 10:33:21,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:21,564 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:21,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash -933843479, now seen corresponding path program 1 times [2025-04-30 10:33:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:21,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228499100] [2025-04-30 10:33:21,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:21,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:33:21,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:33:21,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:21,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:21,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:21,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228499100] [2025-04-30 10:33:21,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228499100] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:21,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879692291] [2025-04-30 10:33:21,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:21,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:21,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:21,754 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-30 10:33:21,756 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-30 10:33:21,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:33:21,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:33:21,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:21,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:21,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-30 10:33:21,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:21,843 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-30 10:33:21,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2025-04-30 10:33:21,856 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-30 10:33:21,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:21,875 INFO L325 Elim1Store]: treesize reduction 21, result has 12.5 percent of original size [2025-04-30 10:33:21,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 11 [2025-04-30 10:33:21,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:21,888 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:33:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:22,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879692291] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:22,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:33:22,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 11 [2025-04-30 10:33:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884897604] [2025-04-30 10:33:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:22,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:22,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:22,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:22,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:33:22,304 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-30 10:33:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:22,348 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2025-04-30 10:33:22,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:22,349 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-30 10:33:22,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:22,350 INFO L225 Difference]: With dead ends: 148 [2025-04-30 10:33:22,350 INFO L226 Difference]: Without dead ends: 148 [2025-04-30 10:33:22,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:33:22,351 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:22,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 80 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-04-30 10:33:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 102. [2025-04-30 10:33:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 101 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-30 10:33:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2025-04-30 10:33:22,359 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 22 [2025-04-30 10:33:22,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:22,359 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2025-04-30 10:33:22,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-30 10:33:22,359 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2025-04-30 10:33:22,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:33:22,359 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:22,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:22,367 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-30 10:33:22,560 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-30 10:33:22,560 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:22,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1760695504, now seen corresponding path program 1 times [2025-04-30 10:33:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:22,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521595199] [2025-04-30 10:33:22,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:22,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:22,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:33:22,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:33:22,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:22,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:33:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:22,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521595199] [2025-04-30 10:33:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521595199] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:22,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72092698] [2025-04-30 10:33:22,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:22,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:22,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:22,612 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-30 10:33:22,615 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-30 10:33:22,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:33:22,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:33:22,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:22,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:22,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:33:22,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:33:22,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:33:22,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72092698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:22,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:33:22,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:33:22,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133130593] [2025-04-30 10:33:22,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:22,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:22,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:22,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:22,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:22,721 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:22,744 INFO L93 Difference]: Finished difference Result 148 states and 180 transitions. [2025-04-30 10:33:22,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:22,745 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-30 10:33:22,745 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:22,745 INFO L225 Difference]: With dead ends: 148 [2025-04-30 10:33:22,745 INFO L226 Difference]: Without dead ends: 148 [2025-04-30 10:33:22,746 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:22,746 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:22,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-04-30 10:33:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2025-04-30 10:33:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 134 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-30 10:33:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 167 transitions. [2025-04-30 10:33:22,748 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 167 transitions. Word has length 24 [2025-04-30 10:33:22,748 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:22,748 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 167 transitions. [2025-04-30 10:33:22,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:22,751 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions. [2025-04-30 10:33:22,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:33:22,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:22,751 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, 1, 1] [2025-04-30 10:33:22,758 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-30 10:33:22,952 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-30 10:33:22,952 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:22,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1760661807, now seen corresponding path program 1 times [2025-04-30 10:33:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:22,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623905322] [2025-04-30 10:33:22,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:22,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:33:22,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:33:22,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:22,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:33:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:23,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623905322] [2025-04-30 10:33:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623905322] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:23,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69306313] [2025-04-30 10:33:23,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:23,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:23,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:23,137 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-30 10:33:23,139 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-30 10:33:23,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:33:23,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:33:23,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:23,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:23,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-30 10:33:23,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:33:24,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:33:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69306313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:24,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:33:24,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-04-30 10:33:24,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519777154] [2025-04-30 10:33:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:24,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:24,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:24,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:24,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:33:24,134 INFO L87 Difference]: Start difference. First operand 135 states and 167 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:24,208 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2025-04-30 10:33:24,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:33:24,208 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-30 10:33:24,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:24,209 INFO L225 Difference]: With dead ends: 134 [2025-04-30 10:33:24,210 INFO L226 Difference]: Without dead ends: 109 [2025-04-30 10:33:24,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:33:24,211 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:24,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-30 10:33:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-30 10:33:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 108 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2025-04-30 10:33:24,213 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 24 [2025-04-30 10:33:24,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:24,213 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2025-04-30 10:33:24,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:24,213 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2025-04-30 10:33:24,213 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:33:24,213 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:24,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:24,222 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-30 10:33:24,421 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-30 10:33:24,421 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:24,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:24,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1379348061, now seen corresponding path program 2 times [2025-04-30 10:33:24,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:24,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114649584] [2025-04-30 10:33:24,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:24,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:24,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-30 10:33:24,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:33:24,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:24,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:33:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:24,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114649584] [2025-04-30 10:33:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114649584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:24,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337382159] [2025-04-30 10:33:24,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:24,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:24,651 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-30 10:33:24,653 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-30 10:33:24,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-30 10:33:24,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:33:24,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:24,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:24,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:33:24,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:24,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:24,891 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-30 10:33:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:24,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337382159] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:24,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:24,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-04-30 10:33:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478133355] [2025-04-30 10:33:24,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:24,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:33:24,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:24,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:33:24,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:33:24,940 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:25,291 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2025-04-30 10:33:25,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:33:25,292 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-30 10:33:25,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:25,292 INFO L225 Difference]: With dead ends: 131 [2025-04-30 10:33:25,293 INFO L226 Difference]: Without dead ends: 104 [2025-04-30 10:33:25,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:33:25,293 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 68 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:25,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 212 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-30 10:33:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2025-04-30 10:33:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 83 states have internal predecessors, (103), 0 states have call successors, (0), 0 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-30 10:33:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2025-04-30 10:33:25,295 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 24 [2025-04-30 10:33:25,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:25,296 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2025-04-30 10:33:25,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:25,296 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2025-04-30 10:33:25,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:33:25,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:25,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:25,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:33:25,497 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-30 10:33:25,497 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:25,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1541840786, now seen corresponding path program 1 times [2025-04-30 10:33:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:25,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060822012] [2025-04-30 10:33:25,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:25,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:25,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:33:25,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:33:25,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:25,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:25,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060822012] [2025-04-30 10:33:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060822012] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:25,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482338064] [2025-04-30 10:33:25,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:25,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:25,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:25,550 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-30 10:33:25,552 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-30 10:33:25,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:33:25,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:33:25,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:25,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:25,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:33:25,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:25,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:25,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482338064] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:25,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:25,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-04-30 10:33:25,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789561127] [2025-04-30 10:33:25,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:25,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:33:25,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:25,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:33:25,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:33:25,707 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:25,743 INFO L93 Difference]: Finished difference Result 137 states and 161 transitions. [2025-04-30 10:33:25,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:33:25,743 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-30 10:33:25,743 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:25,744 INFO L225 Difference]: With dead ends: 137 [2025-04-30 10:33:25,744 INFO L226 Difference]: Without dead ends: 94 [2025-04-30 10:33:25,744 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:33:25,745 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:25,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 129 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-04-30 10:33:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-04-30 10:33:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 89 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-30 10:33:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2025-04-30 10:33:25,747 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 24 [2025-04-30 10:33:25,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:25,747 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2025-04-30 10:33:25,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:25,747 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2025-04-30 10:33:25,748 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:33:25,748 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:25,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:25,754 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-30 10:33:25,948 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-30 10:33:25,949 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:25,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1191762920, now seen corresponding path program 2 times [2025-04-30 10:33:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:25,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415665490] [2025-04-30 10:33:25,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:25,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-30 10:33:25,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:33:25,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:25,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:33:26,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:26,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415665490] [2025-04-30 10:33:26,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415665490] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:26,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760365462] [2025-04-30 10:33:26,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:26,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:26,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:26,141 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-30 10:33:26,142 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-30 10:33:26,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-30 10:33:26,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:33:26,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:26,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:26,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:33:26,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:26,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:26,432 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-30 10:33:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:33:26,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760365462] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:26,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:26,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-30 10:33:26,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250914261] [2025-04-30 10:33:26,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:26,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:33:26,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:26,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:33:26,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:33:26,469 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 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-30 10:33:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:26,661 INFO L93 Difference]: Finished difference Result 165 states and 197 transitions. [2025-04-30 10:33:26,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:33:26,661 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 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 27 [2025-04-30 10:33:26,662 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:26,662 INFO L225 Difference]: With dead ends: 165 [2025-04-30 10:33:26,662 INFO L226 Difference]: Without dead ends: 165 [2025-04-30 10:33:26,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:33:26,663 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 87 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:26,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 194 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-04-30 10:33:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 82. [2025-04-30 10:33:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 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-30 10:33:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2025-04-30 10:33:26,665 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 27 [2025-04-30 10:33:26,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:26,665 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2025-04-30 10:33:26,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.294117647058823) internal successors, (73), 18 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-30 10:33:26,665 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2025-04-30 10:33:26,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:33:26,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:26,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:26,671 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-30 10:33:26,870 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-30 10:33:26,870 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:26,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash -560689198, now seen corresponding path program 1 times [2025-04-30 10:33:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:26,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046325100] [2025-04-30 10:33:26,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:26,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:26,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:33:26,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:33:26,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:26,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:33:27,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:27,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046325100] [2025-04-30 10:33:27,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046325100] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:27,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689953321] [2025-04-30 10:33:27,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:27,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:27,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:27,171 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-30 10:33:27,173 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-30 10:33:27,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:33:27,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:33:27,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:27,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:27,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-30 10:33:27,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:27,281 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-30 10:33:27,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2025-04-30 10:33:27,313 INFO L325 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2025-04-30 10:33:27,313 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 1 case distinctions, treesize of input 18 treesize of output 19 [2025-04-30 10:33:27,336 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-30 10:33:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:33:27,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:33:28,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689953321] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:28,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:28,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-30 10:33:28,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282939710] [2025-04-30 10:33:28,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:28,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:33:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:28,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:33:28,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:33:28,028 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 17 states, 16 states have (on average 6.25) internal successors, (100), 17 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-30 10:33:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:28,201 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2025-04-30 10:33:28,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:33:28,202 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.25) internal successors, (100), 17 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) Word has length 36 [2025-04-30 10:33:28,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:28,202 INFO L225 Difference]: With dead ends: 112 [2025-04-30 10:33:28,202 INFO L226 Difference]: Without dead ends: 112 [2025-04-30 10:33:28,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:33:28,203 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:28,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 113 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:28,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-30 10:33:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-04-30 10:33:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.205607476635514) internal successors, (129), 107 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2025-04-30 10:33:28,206 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 36 [2025-04-30 10:33:28,206 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:28,206 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2025-04-30 10:33:28,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.25) internal successors, (100), 17 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-30 10:33:28,206 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2025-04-30 10:33:28,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:33:28,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:28,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:28,215 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-30 10:33:28,407 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,SelfDestructingSolverStorable27 [2025-04-30 10:33:28,407 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:28,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1527462781, now seen corresponding path program 2 times [2025-04-30 10:33:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:28,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907600200] [2025-04-30 10:33:28,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:28,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-30 10:33:28,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:33:28,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:28,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:33:28,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:28,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907600200] [2025-04-30 10:33:28,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907600200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:28,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857125172] [2025-04-30 10:33:28,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:28,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:28,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:28,503 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-30 10:33:28,504 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-30 10:33:28,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-30 10:33:28,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:33:28,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:28,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:28,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:33:28,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:33:28,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:33:28,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857125172] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:28,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:28,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-04-30 10:33:28,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665972852] [2025-04-30 10:33:28,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:28,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:33:28,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:28,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:33:28,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:33:28,731 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:28,782 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2025-04-30 10:33:28,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:33:28,782 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-30 10:33:28,782 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:28,783 INFO L225 Difference]: With dead ends: 217 [2025-04-30 10:33:28,783 INFO L226 Difference]: Without dead ends: 118 [2025-04-30 10:33:28,783 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:33:28,783 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:28,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 208 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-30 10:33:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2025-04-30 10:33:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 113 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-30 10:33:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2025-04-30 10:33:28,785 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 47 [2025-04-30 10:33:28,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:28,785 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2025-04-30 10:33:28,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:28,786 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2025-04-30 10:33:28,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:33:28,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:28,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:28,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-30 10:33:28,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:33:28,987 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:28,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash -41353271, now seen corresponding path program 3 times [2025-04-30 10:33:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:28,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449085823] [2025-04-30 10:33:28,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:28,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:28,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-04-30 10:33:29,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:33:29,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:33:29,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:33:29,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:29,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449085823] [2025-04-30 10:33:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449085823] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:29,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369499469] [2025-04-30 10:33:29,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:29,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:29,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:29,335 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-30 10:33:29,337 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-30 10:33:29,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 5 equivalence classes. [2025-04-30 10:33:29,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:33:29,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:33:29,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:29,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-30 10:33:29,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:29,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:29,501 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-30 10:33:29,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2025-04-30 10:33:29,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-30 10:33:29,514 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-30 10:33:29,520 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 15 [2025-04-30 10:33:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:33:30,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:33:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369499469] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:30,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:30,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 24 [2025-04-30 10:33:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772685364] [2025-04-30 10:33:30,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:30,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:33:30,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:30,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:33:30,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:33:30,511 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 25 states, 24 states have (on average 5.416666666666667) internal successors, (130), 25 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-30 10:33:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:30,934 INFO L93 Difference]: Finished difference Result 214 states and 250 transitions. [2025-04-30 10:33:30,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:33:30,935 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.416666666666667) internal successors, (130), 25 states have internal predecessors, (130), 0 states have call successors, (0), 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 50 [2025-04-30 10:33:30,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:30,935 INFO L225 Difference]: With dead ends: 214 [2025-04-30 10:33:30,935 INFO L226 Difference]: Without dead ends: 214 [2025-04-30 10:33:30,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:33:30,936 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 94 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:30,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 259 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-30 10:33:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 192. [2025-04-30 10:33:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.193717277486911) internal successors, (228), 191 states have internal predecessors, (228), 0 states have call successors, (0), 0 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-30 10:33:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 228 transitions. [2025-04-30 10:33:30,940 INFO L79 Accepts]: Start accepts. Automaton has 192 states and 228 transitions. Word has length 50 [2025-04-30 10:33:30,940 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:30,940 INFO L485 AbstractCegarLoop]: Abstraction has 192 states and 228 transitions. [2025-04-30 10:33:30,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.416666666666667) internal successors, (130), 25 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-30 10:33:30,943 INFO L278 IsEmpty]: Start isEmpty. Operand 192 states and 228 transitions. [2025-04-30 10:33:30,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-04-30 10:33:30,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:30,944 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:30,951 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-30 10:33:31,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:31,144 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:31,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:31,146 INFO L85 PathProgramCache]: Analyzing trace with hash -150520820, now seen corresponding path program 4 times [2025-04-30 10:33:31,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:31,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346556852] [2025-04-30 10:33:31,146 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:31,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:31,156 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-04-30 10:33:31,164 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-04-30 10:33:31,164 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:33:31,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 132 proven. 65 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:33:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:31,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346556852] [2025-04-30 10:33:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346556852] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:31,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820951631] [2025-04-30 10:33:31,312 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:31,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:31,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:31,314 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-30 10:33:31,316 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-30 10:33:31,388 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-04-30 10:33:31,433 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-04-30 10:33:31,434 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:33:31,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:31,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:33:31,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 185 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:33:31,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 185 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:33:31,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820951631] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:31,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:31,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-30 10:33:31,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836188330] [2025-04-30 10:33:31,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:31,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:33:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:31,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:33:31,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:33:31,694 INFO L87 Difference]: Start difference. First operand 192 states and 228 transitions. Second operand has 25 states, 25 states have (on average 7.44) internal successors, (186), 25 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-30 10:33:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:31,793 INFO L93 Difference]: Finished difference Result 818 states and 949 transitions. [2025-04-30 10:33:31,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:33:31,793 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.44) internal successors, (186), 25 states have internal predecessors, (186), 0 states have call successors, (0), 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 83 [2025-04-30 10:33:31,793 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:31,794 INFO L225 Difference]: With dead ends: 818 [2025-04-30 10:33:31,794 INFO L226 Difference]: Without dead ends: 214 [2025-04-30 10:33:31,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:33:31,794 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:31,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 396 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:31,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-30 10:33:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2025-04-30 10:33:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.1770334928229664) internal successors, (246), 209 states have internal predecessors, (246), 0 states have call successors, (0), 0 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-30 10:33:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 246 transitions. [2025-04-30 10:33:31,797 INFO L79 Accepts]: Start accepts. Automaton has 210 states and 246 transitions. Word has length 83 [2025-04-30 10:33:31,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:31,797 INFO L485 AbstractCegarLoop]: Abstraction has 210 states and 246 transitions. [2025-04-30 10:33:31,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.44) internal successors, (186), 25 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-30 10:33:31,797 INFO L278 IsEmpty]: Start isEmpty. Operand 210 states and 246 transitions. [2025-04-30 10:33:31,798 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-04-30 10:33:31,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:31,798 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:31,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-30 10:33:32,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:32,002 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:32,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1759236626, now seen corresponding path program 5 times [2025-04-30 10:33:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:32,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609028340] [2025-04-30 10:33:32,003 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:33:32,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:32,012 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 9 equivalence classes. [2025-04-30 10:33:32,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:33:32,038 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-04-30 10:33:32,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 106 proven. 80 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-04-30 10:33:32,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:32,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609028340] [2025-04-30 10:33:32,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609028340] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:32,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063271546] [2025-04-30 10:33:32,547 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:33:32,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:32,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:32,550 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-30 10:33:32,551 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-30 10:33:32,628 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 9 equivalence classes. [2025-04-30 10:33:32,753 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:33:32,754 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-04-30 10:33:32,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:32,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-30 10:33:32,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:32,768 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-30 10:33:32,775 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 15 [2025-04-30 10:33:32,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:32,799 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-30 10:33:32,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2025-04-30 10:33:32,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:32,807 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:33:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-04-30 10:33:33,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 1 proven. 185 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-04-30 10:33:34,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063271546] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:34,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:34,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-04-30 10:33:34,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230904165] [2025-04-30 10:33:34,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:34,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-30 10:33:34,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:34,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-30 10:33:34,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=1416, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:33:34,602 INFO L87 Difference]: Start difference. First operand 210 states and 246 transitions. Second operand has 43 states, 42 states have (on average 5.309523809523809) internal successors, (223), 43 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:35,016 INFO L93 Difference]: Finished difference Result 291 states and 331 transitions. [2025-04-30 10:33:35,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:33:35,017 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 5.309523809523809) internal successors, (223), 43 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-04-30 10:33:35,017 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:35,017 INFO L225 Difference]: With dead ends: 291 [2025-04-30 10:33:35,017 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:33:35,018 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=558, Invalid=1892, Unknown=0, NotChecked=0, Total=2450 [2025-04-30 10:33:35,018 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 155 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 615 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-30 10:33:35,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 615 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:33:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:33:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:33:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:33:35,019 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2025-04-30 10:33:35,020 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:35,020 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:33:35,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 5.309523809523809) internal successors, (223), 43 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:35,020 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:33:35,020 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:33:35,022 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 13 remaining) [2025-04-30 10:33:35,022 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-04-30 10:33:35,022 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-04-30 10:33:35,022 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2025-04-30 10:33:35,022 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-04-30 10:33:35,022 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-04-30 10:33:35,022 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2025-04-30 10:33:35,022 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-04-30 10:33:35,022 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-04-30 10:33:35,022 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2025-04-30 10:33:35,023 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-04-30 10:33:35,023 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-04-30 10:33:35,023 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-04-30 10:33:35,031 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-30 10:33:35,223 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,SelfDestructingSolverStorable31 [2025-04-30 10:33:35,225 INFO L422 BasicCegarLoop]: Path program histogram: [5, 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-30 10:33:35,227 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:33:35,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:33:35 BoogieIcfgContainer [2025-04-30 10:33:35,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:33:35,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:33:35,229 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:33:35,229 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:33:35,229 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:13" (3/4) ... [2025-04-30 10:33:35,231 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:33:35,239 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-04-30 10:33:35,239 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:33:35,240 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:33:35,240 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:33:35,300 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:33:35,301 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:33:35,301 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:33:35,302 INFO L158 Benchmark]: Toolchain (without parser) took 22874.94ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 110.4MB in the beginning and 363.7MB in the end (delta: -253.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2025-04-30 10:33:35,302 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:33:35,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.75ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 90.4MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:33:35,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.69ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:33:35,304 INFO L158 Benchmark]: Boogie Preprocessor took 36.02ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 85.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:33:35,304 INFO L158 Benchmark]: RCFGBuilder took 300.08ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 70.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:33:35,304 INFO L158 Benchmark]: TraceAbstraction took 22079.12ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 69.1MB in the beginning and 371.2MB in the end (delta: -302.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:33:35,304 INFO L158 Benchmark]: Witness Printer took 72.73ms. Allocated memory is still 419.4MB. Free memory was 371.2MB in the beginning and 363.7MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:33:35,305 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.75ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 90.4MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.69ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.02ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 85.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 300.08ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 70.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22079.12ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 69.1MB in the beginning and 371.2MB in the end (delta: -302.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.73ms. Allocated memory is still 419.4MB. Free memory was 371.2MB in the beginning and 363.7MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 45 edges, 13 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 32, TraceHistogramMax: 6, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 825 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 825 mSDsluCounter, 4415 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3478 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3515 IncrementalHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 937 mSDtfsCounter, 3515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 928 SyntacticMatches, 24 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=31, InterpolantAutomatonStates: 249, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 309 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 1357 NumberOfCodeBlocks, 1357 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 1795 ConstructedInterpolants, 70 QuantifiedInterpolants, 26912 SizeOfPredicates, 95 NumberOfNonLiveVariables, 3781 ConjunctsInSsa, 416 ConjunctsInUnsatCore, 67 InterpolantComputations, 19 PerfectInterpolantSequences, 1091/1882 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:33:35,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE