./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0504.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety/test-0504.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb7811d5e0bb0c6dbfb924983f03b2d75bb92f6242991bb09009aae47f118b8f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:25:36,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:25:36,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:25:36,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:25:36,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:25:36,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:25:36,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:25:36,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:25:36,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:25:36,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:25:36,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:25:36,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:25:36,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:25:36,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:25:36,692 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:25:36,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:25:36,692 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:25:36,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:25:36,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:25:36,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:25:36,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:25:36,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:25:36,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:25:36,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:25:36,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:25:36,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:25:36,694 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 -> eb7811d5e0bb0c6dbfb924983f03b2d75bb92f6242991bb09009aae47f118b8f [2025-04-29 11:25:36,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:25:36,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:25:36,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:25:36,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:25:36,919 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:25:36,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504.c [2025-04-29 11:25:38,139 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55da71158/95adf3ce92a54783a1d3615a407db1fd/FLAGbc89c3249 [2025-04-29 11:25:38,324 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:25:38,324 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0504.c [2025-04-29 11:25:38,326 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:25:38,326 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:25:38,334 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55da71158/95adf3ce92a54783a1d3615a407db1fd/FLAGbc89c3249 [2025-04-29 11:25:39,189 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55da71158/95adf3ce92a54783a1d3615a407db1fd [2025-04-29 11:25:39,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:25:39,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:25:39,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:25:39,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:25:39,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:25:39,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1361c27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39, skipping insertion in model container [2025-04-29 11:25:39,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:25:39,343 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:25:39,350 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:25:39,372 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:25:39,384 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:25:39,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39 WrapperNode [2025-04-29 11:25:39,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:25:39,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:25:39,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:25:39,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:25:39,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,412 INFO L138 Inliner]: procedures = 12, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 78 [2025-04-29 11:25:39,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:25:39,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:25:39,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:25:39,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:25:39,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,432 INFO L175 MemorySlicer]: Split 17 memory accesses to 1 slices as follows [17]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 12 writes are split as follows [12]. [2025-04-29 11:25:39,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:25:39,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:25:39,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:25:39,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:25:39,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (1/1) ... [2025-04-29 11:25:39,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:25:39,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:39,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:25:39,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:25:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:25:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:25:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:25:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:25:39,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:25:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:25:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:25:39,552 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:25:39,553 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:25:39,829 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-04-29 11:25:39,830 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:25:39,839 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:25:39,841 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:25:39,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:25:39 BoogieIcfgContainer [2025-04-29 11:25:39,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:25:39,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:25:39,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:25:39,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:25:39,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:25:39" (1/3) ... [2025-04-29 11:25:39,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ade0e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:25:39, skipping insertion in model container [2025-04-29 11:25:39,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:25:39" (2/3) ... [2025-04-29 11:25:39,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ade0e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:25:39, skipping insertion in model container [2025-04-29 11:25:39,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:25:39" (3/3) ... [2025-04-29 11:25:39,849 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0504.c [2025-04-29 11:25:39,861 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:25:39,863 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0504.c that has 1 procedures, 89 locations, 97 edges, 1 initial locations, 4 loop locations, and 41 error locations. [2025-04-29 11:25:39,898 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:25:39,908 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;@53ca2918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:25:39,908 INFO L341 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-04-29 11:25:39,911 INFO L278 IsEmpty]: Start isEmpty. Operand has 89 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 88 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:39,915 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:25:39,915 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:39,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:25:39,916 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:39,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash 28783198, now seen corresponding path program 1 times [2025-04-29 11:25:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:39,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390817917] [2025-04-29 11:25:39,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:39,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:25:39,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:25:39,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:39,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:40,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:40,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390817917] [2025-04-29 11:25:40,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390817917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:40,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080906699] [2025-04-29 11:25:40,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:40,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:25:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:40,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:25:40,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:25:40,034 INFO L87 Difference]: Start difference. First operand has 89 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 88 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:40,046 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-04-29 11:25:40,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:25:40,048 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-04-29 11:25:40,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:40,052 INFO L225 Difference]: With dead ends: 89 [2025-04-29 11:25:40,052 INFO L226 Difference]: Without dead ends: 87 [2025-04-29 11:25:40,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:25:40,058 INFO L437 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:40,059 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-29 11:25:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-04-29 11:25:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-04-29 11:25:40,088 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 5 [2025-04-29 11:25:40,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:40,089 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-04-29 11:25:40,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,089 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-04-29 11:25:40,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:25:40,091 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:40,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:25:40,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:25:40,091 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:40,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash 889544234, now seen corresponding path program 1 times [2025-04-29 11:25:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:40,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402998494] [2025-04-29 11:25:40,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:40,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:25:40,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:25:40,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:40,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:40,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:40,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402998494] [2025-04-29 11:25:40,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402998494] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:40,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:40,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:40,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46957404] [2025-04-29 11:25:40,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:40,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:40,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:40,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:40,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:40,121 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:40,202 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2025-04-29 11:25:40,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:40,203 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-29 11:25:40,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:40,204 INFO L225 Difference]: With dead ends: 117 [2025-04-29 11:25:40,204 INFO L226 Difference]: Without dead ends: 116 [2025-04-29 11:25:40,204 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:40,205 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 26 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:40,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 128 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-29 11:25:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2025-04-29 11:25:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2025-04-29 11:25:40,213 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 6 [2025-04-29 11:25:40,214 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:40,214 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2025-04-29 11:25:40,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,214 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2025-04-29 11:25:40,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:25:40,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:40,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:25:40,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:25:40,215 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:40,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash 889543210, now seen corresponding path program 1 times [2025-04-29 11:25:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:40,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860053461] [2025-04-29 11:25:40,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:40,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:25:40,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:25:40,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:40,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:40,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:40,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860053461] [2025-04-29 11:25:40,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860053461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:40,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:40,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919031894] [2025-04-29 11:25:40,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:40,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:40,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:40,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:40,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:40,258 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:40,280 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2025-04-29 11:25:40,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:40,280 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-29 11:25:40,280 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:40,281 INFO L225 Difference]: With dead ends: 137 [2025-04-29 11:25:40,281 INFO L226 Difference]: Without dead ends: 136 [2025-04-29 11:25:40,281 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:40,281 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:40,281 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 172 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-29 11:25:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 112. [2025-04-29 11:25:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 111 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2025-04-29 11:25:40,290 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 6 [2025-04-29 11:25:40,290 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:40,290 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2025-04-29 11:25:40,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,290 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2025-04-29 11:25:40,290 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:25:40,290 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:40,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:40,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:25:40,291 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:40,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890954, now seen corresponding path program 1 times [2025-04-29 11:25:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:40,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588561253] [2025-04-29 11:25:40,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:40,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:25:40,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:25:40,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:40,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:40,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:40,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588561253] [2025-04-29 11:25:40,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588561253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:40,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:40,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:40,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874423980] [2025-04-29 11:25:40,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:40,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:40,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:40,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:40,358 INFO L87 Difference]: Start difference. First operand 112 states and 141 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:40,450 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2025-04-29 11:25:40,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:40,451 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:25:40,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:40,452 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:25:40,452 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:25:40,453 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:40,453 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 35 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:40,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 72 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:25:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-04-29 11:25:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 103 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2025-04-29 11:25:40,457 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 7 [2025-04-29 11:25:40,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:40,457 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2025-04-29 11:25:40,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,457 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2025-04-29 11:25:40,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:25:40,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:40,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:40,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:25:40,458 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:40,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890955, now seen corresponding path program 1 times [2025-04-29 11:25:40,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:40,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74440723] [2025-04-29 11:25:40,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:40,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:25:40,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:25:40,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:40,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:40,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74440723] [2025-04-29 11:25:40,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74440723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:40,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:40,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:40,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966856534] [2025-04-29 11:25:40,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:40,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:40,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:40,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:40,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:40,535 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:40,608 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2025-04-29 11:25:40,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:40,608 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:25:40,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:40,610 INFO L225 Difference]: With dead ends: 112 [2025-04-29 11:25:40,610 INFO L226 Difference]: Without dead ends: 112 [2025-04-29 11:25:40,611 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:40,612 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:40,612 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 107 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:40,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-29 11:25:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2025-04-29 11:25:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.644736842105263) internal successors, (125), 103 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2025-04-29 11:25:40,617 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 7 [2025-04-29 11:25:40,618 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:40,618 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2025-04-29 11:25:40,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,618 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2025-04-29 11:25:40,618 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:25:40,618 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:40,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:40,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:25:40,619 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:40,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2104625307, now seen corresponding path program 1 times [2025-04-29 11:25:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:40,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529058739] [2025-04-29 11:25:40,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:40,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:40,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:25:40,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:25:40,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:40,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:40,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:40,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529058739] [2025-04-29 11:25:40,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529058739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:40,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:40,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:25:40,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024897266] [2025-04-29 11:25:40,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:40,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:40,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:40,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:40,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:40,877 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:40,952 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2025-04-29 11:25:40,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:25:40,953 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:25:40,953 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:40,953 INFO L225 Difference]: With dead ends: 101 [2025-04-29 11:25:40,953 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:25:40,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:25:40,954 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 64 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:40,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 77 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:25:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2025-04-29 11:25:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2025-04-29 11:25:40,964 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 17 [2025-04-29 11:25:40,964 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:40,964 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2025-04-29 11:25:40,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:40,965 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2025-04-29 11:25:40,965 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:25:40,965 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:40,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:40,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:25:40,965 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:40,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash 818875072, now seen corresponding path program 1 times [2025-04-29 11:25:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:40,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354787531] [2025-04-29 11:25:40,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:40,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:40,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:25:40,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:25:40,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:40,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:41,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:41,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354787531] [2025-04-29 11:25:41,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354787531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:41,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:41,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:41,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194682041] [2025-04-29 11:25:41,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:41,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:41,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:41,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:41,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:41,050 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-29 11:25:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:41,103 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2025-04-29 11:25:41,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:41,103 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-29 11:25:41,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:41,104 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:25:41,104 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:25:41,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:41,107 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:41,107 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 89 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:25:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-04-29 11:25:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 91 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-29 11:25:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2025-04-29 11:25:41,113 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 18 [2025-04-29 11:25:41,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:41,113 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2025-04-29 11:25:41,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-29 11:25:41,113 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2025-04-29 11:25:41,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:25:41,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:41,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:41,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:25:41,113 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:41,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash 818875073, now seen corresponding path program 1 times [2025-04-29 11:25:41,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:41,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540370662] [2025-04-29 11:25:41,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:41,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:41,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:25:41,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:25:41,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:41,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:41,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:41,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540370662] [2025-04-29 11:25:41,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540370662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:41,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:41,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868370296] [2025-04-29 11:25:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:41,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:41,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:41,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:41,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:41,211 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-29 11:25:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:41,245 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2025-04-29 11:25:41,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:41,245 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-29 11:25:41,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:41,246 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:25:41,246 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:25:41,246 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:41,246 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:41,246 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:25:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-04-29 11:25:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 87 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2025-04-29 11:25:41,254 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 18 [2025-04-29 11:25:41,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:41,254 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2025-04-29 11:25:41,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-29 11:25:41,254 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2025-04-29 11:25:41,255 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:25:41,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:41,255 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:41,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:25:41,255 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:41,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash -492034805, now seen corresponding path program 1 times [2025-04-29 11:25:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:41,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274995683] [2025-04-29 11:25:41,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:41,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:25:41,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:25:41,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:41,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:41,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274995683] [2025-04-29 11:25:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274995683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:41,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:41,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:41,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930777397] [2025-04-29 11:25:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:41,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:25:41,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:41,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:25:41,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:41,299 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:41,382 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2025-04-29 11:25:41,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:25:41,382 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:25:41,382 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:41,383 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:25:41,383 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:25:41,383 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-29 11:25:41,383 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 50 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:41,383 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 98 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:25:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-04-29 11:25:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.356164383561644) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2025-04-29 11:25:41,389 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 20 [2025-04-29 11:25:41,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:41,390 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2025-04-29 11:25:41,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,390 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2025-04-29 11:25:41,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:25:41,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:41,390 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:41,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:25:41,391 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:41,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:41,391 INFO L85 PathProgramCache]: Analyzing trace with hash -492033781, now seen corresponding path program 1 times [2025-04-29 11:25:41,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:41,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163717165] [2025-04-29 11:25:41,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:41,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:41,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:25:41,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:25:41,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:41,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:41,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163717165] [2025-04-29 11:25:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163717165] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:41,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:25:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249157849] [2025-04-29 11:25:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:41,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:25:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:41,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:25:41,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:41,431 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:41,484 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-04-29 11:25:41,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:25:41,485 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:25:41,485 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:41,485 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:25:41,485 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:25:41,485 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-29 11:25:41,486 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 53 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:41,486 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 142 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:41,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:25:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-04-29 11:25:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2025-04-29 11:25:41,488 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 20 [2025-04-29 11:25:41,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:41,488 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2025-04-29 11:25:41,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,488 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2025-04-29 11:25:41,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:25:41,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:41,492 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:41,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:25:41,492 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:41,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash -492034804, now seen corresponding path program 1 times [2025-04-29 11:25:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:41,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250884665] [2025-04-29 11:25:41,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:41,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:41,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:25:41,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:25:41,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:41,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:41,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:41,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250884665] [2025-04-29 11:25:41,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250884665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:41,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:41,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:41,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925897034] [2025-04-29 11:25:41,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:41,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:25:41,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:41,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:25:41,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:41,608 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:41,698 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2025-04-29 11:25:41,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:25:41,699 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:25:41,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:41,699 INFO L225 Difference]: With dead ends: 125 [2025-04-29 11:25:41,699 INFO L226 Difference]: Without dead ends: 125 [2025-04-29 11:25:41,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:41,700 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:41,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 130 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-29 11:25:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2025-04-29 11:25:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.305263157894737) internal successors, (124), 111 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2025-04-29 11:25:41,702 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 20 [2025-04-29 11:25:41,702 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:41,702 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2025-04-29 11:25:41,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,702 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2025-04-29 11:25:41,707 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:25:41,707 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:41,707 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] [2025-04-29 11:25:41,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:25:41,709 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:41,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash -306942496, now seen corresponding path program 1 times [2025-04-29 11:25:41,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:41,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736794245] [2025-04-29 11:25:41,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:41,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:25:41,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:25:41,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:41,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:41,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736794245] [2025-04-29 11:25:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736794245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:41,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:41,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:25:41,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098239831] [2025-04-29 11:25:41,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:41,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:25:41,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:41,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:25:41,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:25:41,861 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 6 states, 5 states have (on average 4.2) 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-29 11:25:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:41,970 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2025-04-29 11:25:41,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:25:41,970 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) 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-29 11:25:41,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:41,971 INFO L225 Difference]: With dead ends: 143 [2025-04-29 11:25:41,971 INFO L226 Difference]: Without dead ends: 143 [2025-04-29 11:25:41,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:25:41,972 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 8 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:41,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 191 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-04-29 11:25:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2025-04-29 11:25:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 111 states have (on average 1.2882882882882882) internal successors, (143), 127 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2025-04-29 11:25:41,977 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 21 [2025-04-29 11:25:41,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:41,977 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2025-04-29 11:25:41,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) 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-29 11:25:41,977 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2025-04-29 11:25:41,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:25:41,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:41,978 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] [2025-04-29 11:25:41,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:25:41,978 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:41,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:41,978 INFO L85 PathProgramCache]: Analyzing trace with hash -306942495, now seen corresponding path program 1 times [2025-04-29 11:25:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:41,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047809398] [2025-04-29 11:25:41,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:41,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:25:41,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:25:41,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:41,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:42,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:42,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047809398] [2025-04-29 11:25:42,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047809398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:42,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:42,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:25:42,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829173275] [2025-04-29 11:25:42,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:42,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:25:42,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:42,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:25:42,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:25:42,396 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-29 11:25:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:42,650 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2025-04-29 11:25:42,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:25:42,651 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-29 11:25:42,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:42,651 INFO L225 Difference]: With dead ends: 142 [2025-04-29 11:25:42,651 INFO L226 Difference]: Without dead ends: 142 [2025-04-29 11:25:42,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:25:42,652 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 101 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:42,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 237 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-04-29 11:25:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2025-04-29 11:25:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 127 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2025-04-29 11:25:42,657 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 21 [2025-04-29 11:25:42,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:42,658 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2025-04-29 11:25:42,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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-29 11:25:42,658 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2025-04-29 11:25:42,658 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:25:42,658 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:42,658 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:42,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:25:42,658 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:42,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:42,659 INFO L85 PathProgramCache]: Analyzing trace with hash -399042708, now seen corresponding path program 1 times [2025-04-29 11:25:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:42,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328850420] [2025-04-29 11:25:42,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:42,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:25:42,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:25:42,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:42,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:25:42,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:42,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328850420] [2025-04-29 11:25:42,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328850420] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:42,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:42,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:42,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342324692] [2025-04-29 11:25:42,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:42,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:25:42,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:42,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:25:42,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:42,700 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-29 11:25:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:42,765 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2025-04-29 11:25:42,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:25:42,766 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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 22 [2025-04-29 11:25:42,766 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:42,766 INFO L225 Difference]: With dead ends: 142 [2025-04-29 11:25:42,767 INFO L226 Difference]: Without dead ends: 142 [2025-04-29 11:25:42,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:42,767 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:42,767 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 104 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-04-29 11:25:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2025-04-29 11:25:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 130 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2025-04-29 11:25:42,770 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 22 [2025-04-29 11:25:42,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:42,770 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2025-04-29 11:25:42,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-29 11:25:42,771 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2025-04-29 11:25:42,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:25:42,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:42,771 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:42,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:25:42,771 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:42,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:42,772 INFO L85 PathProgramCache]: Analyzing trace with hash -399042707, now seen corresponding path program 1 times [2025-04-29 11:25:42,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:42,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490241024] [2025-04-29 11:25:42,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:42,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:25:42,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:25:42,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:42,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:42,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:42,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490241024] [2025-04-29 11:25:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490241024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:42,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:25:42,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783960136] [2025-04-29 11:25:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:42,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:42,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:42,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:42,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:42,864 INFO L87 Difference]: Start difference. First operand 131 states and 147 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-29 11:25:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:42,988 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2025-04-29 11:25:42,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:25:42,988 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-29 11:25:42,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:42,989 INFO L225 Difference]: With dead ends: 157 [2025-04-29 11:25:42,989 INFO L226 Difference]: Without dead ends: 157 [2025-04-29 11:25:42,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:25:42,989 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:42,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 149 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-29 11:25:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2025-04-29 11:25:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 142 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2025-04-29 11:25:42,995 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 22 [2025-04-29 11:25:42,995 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:42,995 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2025-04-29 11:25:42,995 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-29 11:25:42,995 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2025-04-29 11:25:42,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:25:42,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:42,997 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:42,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:25:42,997 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:42,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash 588237890, now seen corresponding path program 1 times [2025-04-29 11:25:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:42,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010223915] [2025-04-29 11:25:42,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:43,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:25:43,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:25:43,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:43,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:43,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:43,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010223915] [2025-04-29 11:25:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010223915] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:43,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:43,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:25:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550900460] [2025-04-29 11:25:43,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:43,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:25:43,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:43,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:25:43,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:25:43,115 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:43,258 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2025-04-29 11:25:43,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:25:43,258 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-29 11:25:43,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:43,259 INFO L225 Difference]: With dead ends: 171 [2025-04-29 11:25:43,260 INFO L226 Difference]: Without dead ends: 171 [2025-04-29 11:25:43,260 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:25:43,260 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 23 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:43,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 241 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-04-29 11:25:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 153. [2025-04-29 11:25:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 152 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2025-04-29 11:25:43,265 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 25 [2025-04-29 11:25:43,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:43,265 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2025-04-29 11:25:43,266 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:43,266 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2025-04-29 11:25:43,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:25:43,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:43,266 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:43,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:25:43,267 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:43,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 588237891, now seen corresponding path program 1 times [2025-04-29 11:25:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:43,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2739798] [2025-04-29 11:25:43,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:43,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:43,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:25:43,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:25:43,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:43,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:43,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:43,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2739798] [2025-04-29 11:25:43,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2739798] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:43,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:43,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:25:43,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114257671] [2025-04-29 11:25:43,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:43,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:25:43,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:43,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:25:43,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:25:43,438 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:43,554 INFO L93 Difference]: Finished difference Result 162 states and 186 transitions. [2025-04-29 11:25:43,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:25:43,554 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-29 11:25:43,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:43,555 INFO L225 Difference]: With dead ends: 162 [2025-04-29 11:25:43,555 INFO L226 Difference]: Without dead ends: 162 [2025-04-29 11:25:43,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:25:43,556 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:43,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 265 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-04-29 11:25:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2025-04-29 11:25:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 136 states have (on average 1.2941176470588236) internal successors, (176), 151 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2025-04-29 11:25:43,558 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 25 [2025-04-29 11:25:43,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:43,559 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2025-04-29 11:25:43,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:43,559 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2025-04-29 11:25:43,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:25:43,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:43,559 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:43,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:25:43,559 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:43,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1055517436, now seen corresponding path program 1 times [2025-04-29 11:25:43,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:43,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926332351] [2025-04-29 11:25:43,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:43,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:43,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:25:43,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:25:43,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:43,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:43,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:43,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926332351] [2025-04-29 11:25:43,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926332351] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:43,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:43,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:25:43,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722371174] [2025-04-29 11:25:43,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:43,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:43,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:43,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:43,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:43,622 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:43,707 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2025-04-29 11:25:43,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:25:43,707 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:25:43,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:43,708 INFO L225 Difference]: With dead ends: 175 [2025-04-29 11:25:43,708 INFO L226 Difference]: Without dead ends: 175 [2025-04-29 11:25:43,708 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:25:43,709 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 67 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:43,709 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 193 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-04-29 11:25:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 166. [2025-04-29 11:25:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 165 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 200 transitions. [2025-04-29 11:25:43,712 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 200 transitions. Word has length 26 [2025-04-29 11:25:43,713 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:43,713 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 200 transitions. [2025-04-29 11:25:43,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:43,713 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 200 transitions. [2025-04-29 11:25:43,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:25:43,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:43,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:43,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:25:43,713 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:43,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1464518790, now seen corresponding path program 1 times [2025-04-29 11:25:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:43,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166825383] [2025-04-29 11:25:43,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:43,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:43,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:25:43,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:25:43,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:43,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:43,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166825383] [2025-04-29 11:25:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166825383] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:43,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069077908] [2025-04-29 11:25:43,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:43,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:43,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:43,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:43,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:25:43,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:25:43,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:25:43,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:43,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:43,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:25:43,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:44,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:25:44,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:25:44,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:25:44,069 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:25:44,098 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:25:44,098 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-04-29 11:25:44,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:25:44,138 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:25:44,138 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:25:44,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-29 11:25:44,192 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:25:44,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-04-29 11:25:44,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-04-29 11:25:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:44,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:44,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069077908] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:44,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:44,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 12 [2025-04-29 11:25:44,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506396011] [2025-04-29 11:25:44,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:44,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:25:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:44,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:25:44,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:25:44,421 INFO L87 Difference]: Start difference. First operand 166 states and 200 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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-29 11:25:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:44,703 INFO L93 Difference]: Finished difference Result 194 states and 227 transitions. [2025-04-29 11:25:44,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:25:44,704 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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) Word has length 29 [2025-04-29 11:25:44,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:44,704 INFO L225 Difference]: With dead ends: 194 [2025-04-29 11:25:44,705 INFO L226 Difference]: Without dead ends: 194 [2025-04-29 11:25:44,705 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:25:44,705 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 140 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:44,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 306 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-29 11:25:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2025-04-29 11:25:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 169 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 204 transitions. [2025-04-29 11:25:44,712 INFO L79 Accepts]: Start accepts. Automaton has 170 states and 204 transitions. Word has length 29 [2025-04-29 11:25:44,712 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:44,712 INFO L485 AbstractCegarLoop]: Abstraction has 170 states and 204 transitions. [2025-04-29 11:25:44,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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-29 11:25:44,713 INFO L278 IsEmpty]: Start isEmpty. Operand 170 states and 204 transitions. [2025-04-29 11:25:44,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:25:44,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:44,713 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:44,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:25:44,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:44,914 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:44,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:44,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1464519814, now seen corresponding path program 1 times [2025-04-29 11:25:44,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:44,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326480973] [2025-04-29 11:25:44,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:44,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:44,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:25:44,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:25:44,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:44,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:44,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326480973] [2025-04-29 11:25:44,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326480973] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:44,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986340862] [2025-04-29 11:25:44,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:44,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:44,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:44,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:44,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:25:45,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:25:45,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:25:45,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:45,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:45,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:25:45,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:45,089 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:25:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:45,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:45,150 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_39|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_39| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2025-04-29 11:25:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-29 11:25:45,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986340862] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:45,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:45,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2025-04-29 11:25:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037228523] [2025-04-29 11:25:45,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:45,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:25:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:45,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:25:45,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2025-04-29 11:25:45,160 INFO L87 Difference]: Start difference. First operand 170 states and 204 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:45,304 INFO L93 Difference]: Finished difference Result 172 states and 205 transitions. [2025-04-29 11:25:45,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:25:45,305 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 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 29 [2025-04-29 11:25:45,305 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:45,305 INFO L225 Difference]: With dead ends: 172 [2025-04-29 11:25:45,305 INFO L226 Difference]: Without dead ends: 161 [2025-04-29 11:25:45,305 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2025-04-29 11:25:45,306 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:45,306 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 241 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 57 Unchecked, 0.1s Time] [2025-04-29 11:25:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-04-29 11:25:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-04-29 11:25:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 159 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2025-04-29 11:25:45,313 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 29 [2025-04-29 11:25:45,313 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:45,313 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2025-04-29 11:25:45,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,316 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2025-04-29 11:25:45,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:25:45,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:45,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:45,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:25:45,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-04-29 11:25:45,517 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:45,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1642908924, now seen corresponding path program 1 times [2025-04-29 11:25:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:45,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279417299] [2025-04-29 11:25:45,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:45,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:25:45,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:25:45,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:45,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:45,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:45,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279417299] [2025-04-29 11:25:45,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279417299] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:45,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996759807] [2025-04-29 11:25:45,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:45,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:45,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:45,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:25:45,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:25:45,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:25:45,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:45,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:45,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:25:45,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:45,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:25:45,739 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:25:45,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:25:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:45,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996759807] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:45,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:45,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2025-04-29 11:25:45,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638005572] [2025-04-29 11:25:45,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:45,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:25:45,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:45,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:25:45,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:25:45,874 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 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-29 11:25:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:45,968 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2025-04-29 11:25:45,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:25:45,969 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 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) Word has length 30 [2025-04-29 11:25:45,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:45,969 INFO L225 Difference]: With dead ends: 180 [2025-04-29 11:25:45,969 INFO L226 Difference]: Without dead ends: 180 [2025-04-29 11:25:45,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:25:45,970 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 110 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:45,970 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 130 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-04-29 11:25:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2025-04-29 11:25:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 158 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 191 transitions. [2025-04-29 11:25:45,975 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 191 transitions. Word has length 30 [2025-04-29 11:25:45,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:45,976 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 191 transitions. [2025-04-29 11:25:45,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 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-29 11:25:45,976 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 191 transitions. [2025-04-29 11:25:45,976 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:25:45,976 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:45,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:45,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:25:46,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:46,177 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:46,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:46,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1642908925, now seen corresponding path program 1 times [2025-04-29 11:25:46,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:46,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720012385] [2025-04-29 11:25:46,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:46,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:46,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:25:46,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:25:46,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:46,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:46,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:46,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720012385] [2025-04-29 11:25:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720012385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:46,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106834434] [2025-04-29 11:25:46,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:46,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:46,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:46,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:46,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:25:46,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:25:46,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:25:46,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:46,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:46,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:25:46,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:46,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:25:46,420 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:25:46,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:46,503 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:25:46,508 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:25:46,509 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:25:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:46,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106834434] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:46,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:46,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2025-04-29 11:25:46,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963649855] [2025-04-29 11:25:46,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:46,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:25:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:46,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:25:46,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:25:46,807 INFO L87 Difference]: Start difference. First operand 159 states and 191 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:46,931 INFO L93 Difference]: Finished difference Result 179 states and 210 transitions. [2025-04-29 11:25:46,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:25:46,931 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 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) Word has length 30 [2025-04-29 11:25:46,931 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:46,932 INFO L225 Difference]: With dead ends: 179 [2025-04-29 11:25:46,932 INFO L226 Difference]: Without dead ends: 179 [2025-04-29 11:25:46,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:25:46,933 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 279 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:46,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 124 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-04-29 11:25:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 158. [2025-04-29 11:25:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.3125) internal successors, (189), 157 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2025-04-29 11:25:46,936 INFO L79 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 30 [2025-04-29 11:25:46,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:46,936 INFO L485 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2025-04-29 11:25:46,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:46,936 INFO L278 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2025-04-29 11:25:46,936 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:25:46,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:46,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:46,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:25:47,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:47,137 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:47,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2032713119, now seen corresponding path program 1 times [2025-04-29 11:25:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:47,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091641642] [2025-04-29 11:25:47,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:47,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:47,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:25:47,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:25:47,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:47,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:47,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:47,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091641642] [2025-04-29 11:25:47,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091641642] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:47,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15644469] [2025-04-29 11:25:47,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:47,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:47,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:47,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:47,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:25:47,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:25:47,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:25:47,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:47,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:47,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:25:47,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:47,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:25:47,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:25:47,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:47,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:25:47,652 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:25:47,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:25:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:47,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15644469] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:47,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 13 [2025-04-29 11:25:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373584621] [2025-04-29 11:25:47,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:47,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:25:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:47,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:25:47,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:25:47,874 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand has 14 states, 13 states have (on average 6.461538461538462) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:48,118 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2025-04-29 11:25:48,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:25:48,119 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.461538461538462) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-29 11:25:48,119 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:48,119 INFO L225 Difference]: With dead ends: 190 [2025-04-29 11:25:48,119 INFO L226 Difference]: Without dead ends: 190 [2025-04-29 11:25:48,120 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:25:48,120 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:48,120 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 192 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:48,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-29 11:25:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2025-04-29 11:25:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 176 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2025-04-29 11:25:48,123 INFO L79 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 34 [2025-04-29 11:25:48,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:48,123 INFO L485 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2025-04-29 11:25:48,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.461538461538462) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,123 INFO L278 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2025-04-29 11:25:48,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:25:48,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:48,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:48,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:25:48,328 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,SelfDestructingSolverStorable22 [2025-04-29 11:25:48,328 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:48,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:48,329 INFO L85 PathProgramCache]: Analyzing trace with hash -823330005, now seen corresponding path program 1 times [2025-04-29 11:25:48,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:48,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784814262] [2025-04-29 11:25:48,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:48,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:48,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:25:48,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:25:48,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:48,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:48,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:48,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784814262] [2025-04-29 11:25:48,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784814262] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:48,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64302833] [2025-04-29 11:25:48,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:48,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:48,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:48,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:48,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:25:48,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:25:48,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:25:48,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:48,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:48,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:25:48,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:48,598 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:25:48,609 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:25:48,628 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-29 11:25:48,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-04-29 11:25:48,663 INFO L325 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-04-29 11:25:48,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-04-29 11:25:48,692 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:25:48,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2025-04-29 11:25:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:48,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:48,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64302833] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:48,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-29 11:25:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666436840] [2025-04-29 11:25:48,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:48,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:25:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:48,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:25:48,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:25:48,789 INFO L87 Difference]: Start difference. First operand 177 states and 210 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:48,996 INFO L93 Difference]: Finished difference Result 176 states and 208 transitions. [2025-04-29 11:25:48,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:25:48,996 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-29 11:25:48,996 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:48,997 INFO L225 Difference]: With dead ends: 176 [2025-04-29 11:25:48,997 INFO L226 Difference]: Without dead ends: 176 [2025-04-29 11:25:48,997 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:25:48,998 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 32 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:48,998 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 298 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-04-29 11:25:49,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-04-29 11:25:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 163 states have (on average 1.2760736196319018) internal successors, (208), 175 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 208 transitions. [2025-04-29 11:25:49,001 INFO L79 Accepts]: Start accepts. Automaton has 176 states and 208 transitions. Word has length 35 [2025-04-29 11:25:49,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:49,001 INFO L485 AbstractCegarLoop]: Abstraction has 176 states and 208 transitions. [2025-04-29 11:25:49,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:49,001 INFO L278 IsEmpty]: Start isEmpty. Operand 176 states and 208 transitions. [2025-04-29 11:25:49,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:25:49,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:49,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:49,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:25:49,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:49,206 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:49,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash -823330004, now seen corresponding path program 1 times [2025-04-29 11:25:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:49,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861592706] [2025-04-29 11:25:49,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:49,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:25:49,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:25:49,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:49,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:49,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:49,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861592706] [2025-04-29 11:25:49,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861592706] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:49,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311251028] [2025-04-29 11:25:49,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:49,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:49,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:49,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:49,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:25:49,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:25:49,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:25:49,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:49,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:49,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:25:49,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:49,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:25:49,578 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:25:49,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:25:49,608 INFO L325 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-04-29 11:25:49,608 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-04-29 11:25:49,667 INFO L325 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-04-29 11:25:49,667 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2025-04-29 11:25:49,680 INFO L325 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-04-29 11:25:49,680 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:25:49,721 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:25:49,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-04-29 11:25:49,725 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:25:49,726 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:25:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:49,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:49,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311251028] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:49,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:49,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-04-29 11:25:49,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770320659] [2025-04-29 11:25:49,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:49,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:25:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:49,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:25:49,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:25:49,909 INFO L87 Difference]: Start difference. First operand 176 states and 208 transitions. Second operand has 21 states, 20 states have (on average 3.85) internal successors, (77), 21 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:50,232 INFO L93 Difference]: Finished difference Result 185 states and 216 transitions. [2025-04-29 11:25:50,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:25:50,233 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 21 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-29 11:25:50,233 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:50,234 INFO L225 Difference]: With dead ends: 185 [2025-04-29 11:25:50,234 INFO L226 Difference]: Without dead ends: 185 [2025-04-29 11:25:50,234 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:25:50,234 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:50,234 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 337 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:25:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-29 11:25:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2025-04-29 11:25:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 147 states have (on average 1.2857142857142858) internal successors, (189), 158 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2025-04-29 11:25:50,237 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 35 [2025-04-29 11:25:50,238 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:50,238 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2025-04-29 11:25:50,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 21 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:50,238 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2025-04-29 11:25:50,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:25:50,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:50,238 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:50,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:25:50,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:50,439 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:50,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:50,443 INFO L85 PathProgramCache]: Analyzing trace with hash 772813698, now seen corresponding path program 1 times [2025-04-29 11:25:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:50,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818669627] [2025-04-29 11:25:50,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:50,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:25:50,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:25:50,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:50,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:50,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:50,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818669627] [2025-04-29 11:25:50,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818669627] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:50,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168692086] [2025-04-29 11:25:50,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:50,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:50,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:50,710 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:50,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:25:50,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:25:50,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:25:50,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:50,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:50,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:25:50,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:25:50,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:25:50,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168692086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:50,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:25:50,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-04-29 11:25:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276503847] [2025-04-29 11:25:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:50,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:25:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:50,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:25:50,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:25:50,899 INFO L87 Difference]: Start difference. First operand 159 states and 189 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:50,972 INFO L93 Difference]: Finished difference Result 164 states and 188 transitions. [2025-04-29 11:25:50,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:25:50,973 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-29 11:25:50,973 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:50,973 INFO L225 Difference]: With dead ends: 164 [2025-04-29 11:25:50,973 INFO L226 Difference]: Without dead ends: 164 [2025-04-29 11:25:50,974 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:25:50,974 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 45 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:50,975 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 134 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-04-29 11:25:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2025-04-29 11:25:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 158 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2025-04-29 11:25:50,977 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 36 [2025-04-29 11:25:50,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:50,978 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2025-04-29 11:25:50,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:50,978 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2025-04-29 11:25:50,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:25:50,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:50,978 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:50,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:25:51,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-29 11:25:51,179 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:51,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1868217740, now seen corresponding path program 1 times [2025-04-29 11:25:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:51,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172700429] [2025-04-29 11:25:51,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:51,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:51,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:25:51,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:25:51,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:51,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:25:51,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:51,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172700429] [2025-04-29 11:25:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172700429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:25:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297422405] [2025-04-29 11:25:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:51,224 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:51,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:51,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:51,224 INFO L87 Difference]: Start difference. First operand 159 states and 188 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:51,269 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2025-04-29 11:25:51,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:25:51,269 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-29 11:25:51,269 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:51,270 INFO L225 Difference]: With dead ends: 165 [2025-04-29 11:25:51,270 INFO L226 Difference]: Without dead ends: 165 [2025-04-29 11:25:51,270 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:25:51,271 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 44 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:51,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 127 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-04-29 11:25:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 128. [2025-04-29 11:25:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 127 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-29 11:25:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2025-04-29 11:25:51,273 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 39 [2025-04-29 11:25:51,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:51,273 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2025-04-29 11:25:51,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:51,275 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2025-04-29 11:25:51,275 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:25:51,275 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:51,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:51,275 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:25:51,275 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:51,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1868217357, now seen corresponding path program 1 times [2025-04-29 11:25:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:51,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916552772] [2025-04-29 11:25:51,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:51,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:25:51,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:25:51,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:51,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:51,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916552772] [2025-04-29 11:25:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916552772] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:51,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:25:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44137845] [2025-04-29 11:25:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:51,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:25:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:51,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:25:51,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:25:51,376 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:51,514 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2025-04-29 11:25:51,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:25:51,514 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-29 11:25:51,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:51,515 INFO L225 Difference]: With dead ends: 150 [2025-04-29 11:25:51,515 INFO L226 Difference]: Without dead ends: 150 [2025-04-29 11:25:51,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:25:51,515 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:51,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 185 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-29 11:25:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2025-04-29 11:25:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 126 states have (on average 1.2619047619047619) internal successors, (159), 137 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2025-04-29 11:25:51,519 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 39 [2025-04-29 11:25:51,519 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:51,519 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2025-04-29 11:25:51,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:51,519 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2025-04-29 11:25:51,519 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:25:51,519 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:51,519 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:51,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:25:51,520 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:51,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1868217358, now seen corresponding path program 1 times [2025-04-29 11:25:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:51,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030348950] [2025-04-29 11:25:51,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:51,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:51,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:25:51,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:25:51,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:51,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:51,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:51,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030348950] [2025-04-29 11:25:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030348950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:51,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:25:51,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768196308] [2025-04-29 11:25:51,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:51,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:25:51,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:51,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:25:51,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:25:51,707 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:51,877 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2025-04-29 11:25:51,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:25:51,877 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-29 11:25:51,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:51,878 INFO L225 Difference]: With dead ends: 164 [2025-04-29 11:25:51,878 INFO L226 Difference]: Without dead ends: 164 [2025-04-29 11:25:51,878 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:25:51,879 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 23 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:51,881 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 268 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-04-29 11:25:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2025-04-29 11:25:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 126 states have (on average 1.253968253968254) internal successors, (158), 137 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2025-04-29 11:25:51,885 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 39 [2025-04-29 11:25:51,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:51,885 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2025-04-29 11:25:51,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:51,885 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2025-04-29 11:25:51,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:25:51,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:51,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:51,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:25:51,885 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:51,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:51,886 INFO L85 PathProgramCache]: Analyzing trace with hash 60553069, now seen corresponding path program 1 times [2025-04-29 11:25:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:51,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731761254] [2025-04-29 11:25:51,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:51,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:25:51,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:25:51,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:51,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:51,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731761254] [2025-04-29 11:25:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731761254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:51,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:51,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:25:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531213896] [2025-04-29 11:25:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:51,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:25:51,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:51,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:25:52,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:25:52,000 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:52,147 INFO L93 Difference]: Finished difference Result 170 states and 192 transitions. [2025-04-29 11:25:52,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:25:52,147 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 11:25:52,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:52,148 INFO L225 Difference]: With dead ends: 170 [2025-04-29 11:25:52,148 INFO L226 Difference]: Without dead ends: 170 [2025-04-29 11:25:52,148 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:25:52,149 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:52,149 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 396 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:52,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-29 11:25:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 140. [2025-04-29 11:25:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 128 states have (on average 1.25) internal successors, (160), 139 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 160 transitions. [2025-04-29 11:25:52,154 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 160 transitions. Word has length 41 [2025-04-29 11:25:52,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:52,154 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 160 transitions. [2025-04-29 11:25:52,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:52,154 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2025-04-29 11:25:52,155 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:25:52,155 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:52,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:52,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:25:52,155 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:52,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1877145288, now seen corresponding path program 1 times [2025-04-29 11:25:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:52,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944323486] [2025-04-29 11:25:52,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:52,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:25:52,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:25:52,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:52,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:52,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944323486] [2025-04-29 11:25:52,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944323486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:52,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:52,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:25:52,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066411288] [2025-04-29 11:25:52,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:52,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:25:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:52,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:25:52,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:25:52,266 INFO L87 Difference]: Start difference. First operand 140 states and 160 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 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-29 11:25:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:52,451 INFO L93 Difference]: Finished difference Result 169 states and 191 transitions. [2025-04-29 11:25:52,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:25:52,452 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-29 11:25:52,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:52,452 INFO L225 Difference]: With dead ends: 169 [2025-04-29 11:25:52,452 INFO L226 Difference]: Without dead ends: 169 [2025-04-29 11:25:52,453 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:25:52,453 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:52,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 331 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-04-29 11:25:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141. [2025-04-29 11:25:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 129 states have (on average 1.248062015503876) internal successors, (161), 140 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2025-04-29 11:25:52,455 INFO L79 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 42 [2025-04-29 11:25:52,456 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:52,456 INFO L485 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2025-04-29 11:25:52,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 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-29 11:25:52,456 INFO L278 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2025-04-29 11:25:52,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:25:52,456 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:52,456 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:52,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-29 11:25:52,456 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:25:52,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:52,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1972497689, now seen corresponding path program 1 times [2025-04-29 11:25:52,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:52,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510221715] [2025-04-29 11:25:52,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:52,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:52,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:25:52,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:25:52,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:52,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:52,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510221715] [2025-04-29 11:25:52,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510221715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:52,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214812437] [2025-04-29 11:25:52,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:52,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:52,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:52,872 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:25:52,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:25:52,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:25:52,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:25:52,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:52,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:52,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-29 11:25:52,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:52,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:25:53,011 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:25:53,016 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:25:53,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:25:53,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:25:53,054 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-29 11:25:53,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:25:53,153 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:25:53,153 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:25:53,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-29 11:25:53,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:25:53,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:25:53,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-29 11:25:53,218 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-29 11:25:53,225 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:25:53,231 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:25:53,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-29 11:25:53,247 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-29 11:25:53,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:25:53,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:53,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:53,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2025-04-29 11:25:53,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:53,305 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-29 11:25:53,333 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:25:53,337 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-29 11:25:53,404 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:25:53,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:25:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:53,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:53,461 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1909 (Array Int Int))) (= |c_ULTIMATE.start_main_~first~0#1.offset| (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1909) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|))) (forall ((v_ArrVal_1908 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1908) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2025-04-29 11:26:01,718 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_1907 Int) (|v_ULTIMATE.start_main_~x~0#1.base_55| Int) (v_ArrVal_1908 (Array Int Int)) (v_ArrVal_1891 (Array Int Int)) (|v_ULTIMATE.start_main_~last~0#1.offset_16| Int) (v_ArrVal_1902 (Array Int Int))) (or (not (= (store (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_1891 .cse0)) .cse1 (select v_ArrVal_1891 .cse1)) v_ArrVal_1891)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1891) |v_ULTIMATE.start_main_~x~0#1.base_55| v_ArrVal_1902) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |v_ULTIMATE.start_main_~last~0#1.offset_16| 12) v_ArrVal_1907)) |v_ULTIMATE.start_main_~x~0#1.base_55| v_ArrVal_1908) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (< |v_ULTIMATE.start_main_~last~0#1.offset_16| |c_ULTIMATE.start_main_~x~0#1.offset|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_55|) 0)))) (forall ((v_ArrVal_1906 Int) (|v_ULTIMATE.start_main_~x~0#1.base_55| Int) (v_ArrVal_1893 Int) (v_ArrVal_1909 (Array Int Int)) (|v_ULTIMATE.start_main_~last~0#1.offset_16| Int) (v_ArrVal_1903 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) .cse1 v_ArrVal_1893)) |v_ULTIMATE.start_main_~x~0#1.base_55| v_ArrVal_1903) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |v_ULTIMATE.start_main_~last~0#1.offset_16| 12) v_ArrVal_1906)) |v_ULTIMATE.start_main_~x~0#1.base_55| v_ArrVal_1909) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (< |v_ULTIMATE.start_main_~last~0#1.offset_16| |c_ULTIMATE.start_main_~x~0#1.offset|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_55|) 0)))))) is different from false [2025-04-29 11:26:01,728 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2025-04-29 11:26:01,734 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:26:01,736 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 5 treesize of output 3 [2025-04-29 11:26:01,740 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:26:01,743 INFO L325 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-04-29 11:26:01,743 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 1 [2025-04-29 11:26:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-04-29 11:26:01,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214812437] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:01,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:01,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 28 [2025-04-29 11:26:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788253769] [2025-04-29 11:26:01,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:01,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:26:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:01,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:26:01,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=551, Unknown=14, NotChecked=98, Total=756 [2025-04-29 11:26:01,770 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:02,444 INFO L93 Difference]: Finished difference Result 199 states and 223 transitions. [2025-04-29 11:26:02,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:26:02,444 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-29 11:26:02,445 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:02,445 INFO L225 Difference]: With dead ends: 199 [2025-04-29 11:26:02,445 INFO L226 Difference]: Without dead ends: 199 [2025-04-29 11:26:02,446 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=222, Invalid=1032, Unknown=14, NotChecked=138, Total=1406 [2025-04-29 11:26:02,446 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 116 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:02,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 532 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 554 Invalid, 0 Unknown, 199 Unchecked, 0.4s Time] [2025-04-29 11:26:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-04-29 11:26:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 164. [2025-04-29 11:26:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 163 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-29 11:26:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2025-04-29 11:26:02,451 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 42 [2025-04-29 11:26:02,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:02,451 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2025-04-29 11:26:02,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:02,451 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2025-04-29 11:26:02,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:26:02,452 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:02,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:02,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:02,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:02,656 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:26:02,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1582114095, now seen corresponding path program 1 times [2025-04-29 11:26:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:02,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108489317] [2025-04-29 11:26:02,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:02,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:26:02,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:26:02,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:02,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:02,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:02,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108489317] [2025-04-29 11:26:02,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108489317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:02,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530587261] [2025-04-29 11:26:02,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:02,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:02,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:02,776 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:02,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:26:02,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:26:02,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:26:02,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:02,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:02,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:26:02,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:02,898 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:26:02,930 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:26:02,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:26:02,954 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 [2025-04-29 11:26:02,995 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:02,996 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2025-04-29 11:26:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:03,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:03,099 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-04-29 11:26:03,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-04-29 11:26:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:03,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530587261] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:03,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:03,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2025-04-29 11:26:03,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929590072] [2025-04-29 11:26:03,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:03,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:26:03,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:03,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:26:03,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:26:03,171 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:03,551 INFO L93 Difference]: Finished difference Result 209 states and 233 transitions. [2025-04-29 11:26:03,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:26:03,551 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-29 11:26:03,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:03,552 INFO L225 Difference]: With dead ends: 209 [2025-04-29 11:26:03,552 INFO L226 Difference]: Without dead ends: 209 [2025-04-29 11:26:03,552 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:26:03,552 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 106 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:03,553 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 509 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:26:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-29 11:26:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 164. [2025-04-29 11:26:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 152 states have (on average 1.2171052631578947) internal successors, (185), 163 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 185 transitions. [2025-04-29 11:26:03,556 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 185 transitions. Word has length 43 [2025-04-29 11:26:03,556 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:03,556 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 185 transitions. [2025-04-29 11:26:03,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:03,556 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 185 transitions. [2025-04-29 11:26:03,557 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:26:03,557 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:03,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:03,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:26:03,757 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,SelfDestructingSolverStorable32 [2025-04-29 11:26:03,757 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:26:03,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1938038065, now seen corresponding path program 1 times [2025-04-29 11:26:03,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:03,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61244589] [2025-04-29 11:26:03,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:03,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:03,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:26:03,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:26:03,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:03,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:03,790 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-29 11:26:03,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:03,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61244589] [2025-04-29 11:26:03,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61244589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:03,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:03,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:26:03,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230378260] [2025-04-29 11:26:03,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:03,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:26:03,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:03,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:26:03,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:03,792 INFO L87 Difference]: Start difference. First operand 164 states and 185 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:03,837 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2025-04-29 11:26:03,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:26:03,837 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-29 11:26:03,837 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:03,837 INFO L225 Difference]: With dead ends: 163 [2025-04-29 11:26:03,838 INFO L226 Difference]: Without dead ends: 163 [2025-04-29 11:26:03,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:26:03,839 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:03,839 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:26:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-29 11:26:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-04-29 11:26:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 152 states have (on average 1.2039473684210527) internal successors, (183), 162 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 183 transitions. [2025-04-29 11:26:03,841 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 183 transitions. Word has length 43 [2025-04-29 11:26:03,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:03,841 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 183 transitions. [2025-04-29 11:26:03,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:03,842 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 183 transitions. [2025-04-29 11:26:03,842 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:26:03,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:03,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:03,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-29 11:26:03,842 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:26:03,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1561230514, now seen corresponding path program 1 times [2025-04-29 11:26:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:03,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615500235] [2025-04-29 11:26:03,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:03,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:26:03,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:26:03,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:03,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:04,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:04,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615500235] [2025-04-29 11:26:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615500235] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:04,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144688322] [2025-04-29 11:26:04,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:04,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:04,314 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:04,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:26:04,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:26:04,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:26:04,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:04,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:04,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-04-29 11:26:04,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:04,447 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:26:04,468 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:26:04,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:26:04,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:26:04,510 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:26:04,540 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-29 11:26:04,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:26:04,583 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:26:04,583 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:26:04,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2025-04-29 11:26:04,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:26:04,819 INFO L325 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2025-04-29 11:26:04,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2025-04-29 11:26:04,823 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 9 treesize of output 7 [2025-04-29 11:26:04,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2025-04-29 11:26:04,870 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:26:04,876 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:26:04,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-29 11:26:04,924 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-29 11:26:04,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2025-04-29 11:26:04,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2025-04-29 11:26:05,289 INFO L325 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2025-04-29 11:26:05,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 54 [2025-04-29 11:26:05,299 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:05,299 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2025-04-29 11:26:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:05,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:07,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2025-04-29 11:26:07,185 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 5 treesize of output 3 [2025-04-29 11:26:07,187 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:26:07,190 INFO L325 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-04-29 11:26:07,190 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 1 [2025-04-29 11:26:07,192 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:26:07,195 INFO L325 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-04-29 11:26:07,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 1 [2025-04-29 11:26:07,197 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:26:07,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 51 treesize of output 49 [2025-04-29 11:26:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:07,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144688322] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:07,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:07,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 22] total 58 [2025-04-29 11:26:07,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935697007] [2025-04-29 11:26:07,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:07,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-29 11:26:07,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:07,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-29 11:26:07,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2983, Unknown=66, NotChecked=0, Total=3306 [2025-04-29 11:26:07,262 INFO L87 Difference]: Start difference. First operand 163 states and 183 transitions. Second operand has 58 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 58 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:09,205 INFO L93 Difference]: Finished difference Result 231 states and 255 transitions. [2025-04-29 11:26:09,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 11:26:09,208 INFO L79 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 58 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-29 11:26:09,208 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:09,208 INFO L225 Difference]: With dead ends: 231 [2025-04-29 11:26:09,208 INFO L226 Difference]: Without dead ends: 231 [2025-04-29 11:26:09,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=528, Invalid=5568, Unknown=66, NotChecked=0, Total=6162 [2025-04-29 11:26:09,210 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 109 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:09,210 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1137 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-29 11:26:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-04-29 11:26:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 193. [2025-04-29 11:26:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 182 states have (on average 1.1813186813186813) internal successors, (215), 192 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2025-04-29 11:26:09,213 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 45 [2025-04-29 11:26:09,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:09,213 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2025-04-29 11:26:09,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 58 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:09,214 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2025-04-29 11:26:09,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:26:09,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:09,214 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:09,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:09,415 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,SelfDestructingSolverStorable34 [2025-04-29 11:26:09,415 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:26:09,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:09,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1020577621, now seen corresponding path program 1 times [2025-04-29 11:26:09,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:09,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035539344] [2025-04-29 11:26:09,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:09,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:09,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:26:09,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:26:09,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:09,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:09,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:09,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035539344] [2025-04-29 11:26:09,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035539344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:09,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646566971] [2025-04-29 11:26:09,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:09,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:09,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:09,605 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:09,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:26:09,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:26:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:26:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:09,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:26:09,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:09,729 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:26:09,784 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:26:09,785 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:26:09,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-04-29 11:26:09,867 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:26:09,868 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-04-29 11:26:09,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-04-29 11:26:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:09,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:09,932 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:09,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-04-29 11:26:09,937 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:09,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2025-04-29 11:26:09,940 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:26:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646566971] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:10,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:10,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-04-29 11:26:10,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952852444] [2025-04-29 11:26:10,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:10,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:26:10,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:10,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:26:10,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=224, Unknown=4, NotChecked=0, Total=272 [2025-04-29 11:26:10,099 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:10,388 INFO L93 Difference]: Finished difference Result 264 states and 295 transitions. [2025-04-29 11:26:10,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:26:10,389 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-04-29 11:26:10,389 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:10,390 INFO L225 Difference]: With dead ends: 264 [2025-04-29 11:26:10,390 INFO L226 Difference]: Without dead ends: 264 [2025-04-29 11:26:10,390 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=468, Unknown=4, NotChecked=0, Total=600 [2025-04-29 11:26:10,390 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 196 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:10,390 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 499 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:26:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-04-29 11:26:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 252. [2025-04-29 11:26:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 241 states have (on average 1.1867219917012448) internal successors, (286), 251 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 286 transitions. [2025-04-29 11:26:10,393 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 286 transitions. Word has length 46 [2025-04-29 11:26:10,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:10,393 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 286 transitions. [2025-04-29 11:26:10,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:10,394 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 286 transitions. [2025-04-29 11:26:10,394 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:26:10,394 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:10,394 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:10,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:10,594 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,SelfDestructingSolverStorable35 [2025-04-29 11:26:10,595 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:26:10,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1020578645, now seen corresponding path program 1 times [2025-04-29 11:26:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:10,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603521696] [2025-04-29 11:26:10,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:10,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:26:10,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:26:10,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:10,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:10,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:10,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603521696] [2025-04-29 11:26:10,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603521696] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:10,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357409402] [2025-04-29 11:26:10,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:10,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:10,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:10,853 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:10,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:26:10,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:26:10,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:26:10,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:10,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:10,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:26:10,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:10,991 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:26:11,062 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:26:11,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:26:11,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-04-29 11:26:11,185 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:26:11,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-04-29 11:26:11,238 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 11:26:11,276 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-04-29 11:26:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:11,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:11,345 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:11,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-04-29 11:26:11,350 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:11,351 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2025-04-29 11:26:11,353 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 9 treesize of output 5 [2025-04-29 11:26:11,367 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:11,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-04-29 11:26:11,372 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:11,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2025-04-29 11:26:11,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:26:11,475 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357409402] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:11,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:11,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2025-04-29 11:26:11,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466301968] [2025-04-29 11:26:11,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:11,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:26:11,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:11,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:26:11,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=409, Unknown=10, NotChecked=0, Total=506 [2025-04-29 11:26:11,476 INFO L87 Difference]: Start difference. First operand 252 states and 286 transitions. Second operand has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 23 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:11,936 INFO L93 Difference]: Finished difference Result 291 states and 328 transitions. [2025-04-29 11:26:11,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:26:11,937 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 23 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-04-29 11:26:11,937 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:11,937 INFO L225 Difference]: With dead ends: 291 [2025-04-29 11:26:11,938 INFO L226 Difference]: Without dead ends: 291 [2025-04-29 11:26:11,938 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=641, Unknown=10, NotChecked=0, Total=812 [2025-04-29 11:26:11,938 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 97 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 14 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:11,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 634 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 893 Invalid, 6 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:26:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-04-29 11:26:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2025-04-29 11:26:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 243 states have (on average 1.1893004115226338) internal successors, (289), 253 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 289 transitions. [2025-04-29 11:26:11,942 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 289 transitions. Word has length 46 [2025-04-29 11:26:11,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:11,942 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 289 transitions. [2025-04-29 11:26:11,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 23 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:11,945 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 289 transitions. [2025-04-29 11:26:11,946 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:26:11,946 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:11,946 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:11,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:12,146 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,SelfDestructingSolverStorable36 [2025-04-29 11:26:12,147 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:26:12,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:12,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1020578644, now seen corresponding path program 1 times [2025-04-29 11:26:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:12,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343078833] [2025-04-29 11:26:12,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:12,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:12,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:26:12,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:26:12,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:12,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:12,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:12,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343078833] [2025-04-29 11:26:12,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343078833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:12,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040090705] [2025-04-29 11:26:12,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:12,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:12,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:12,545 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:12,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:26:12,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:26:12,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:26:12,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:12,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:12,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-29 11:26:12,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:12,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:26:12,731 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:26:12,731 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:26:12,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:26:12,823 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-04-29 11:26:12,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-04-29 11:26:12,853 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:26:12,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-04-29 11:26:12,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-29 11:26:12,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 11:26:12,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2025-04-29 11:26:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:12,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:13,002 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2738) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2737) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))) (forall ((v_ArrVal_2738 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2738) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 12))))) is different from false [2025-04-29 11:26:13,008 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:13,008 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-04-29 11:26:13,011 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:13,011 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-04-29 11:26:13,016 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:13,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 61 [2025-04-29 11:26:13,024 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:13,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 89 [2025-04-29 11:26:13,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:26:13,042 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 11 treesize of output 7 [2025-04-29 11:26:13,046 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:13,047 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-04-29 11:26:13,048 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:26:13,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:26:13,050 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-29 11:26:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:13,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040090705] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:13,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:13,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2025-04-29 11:26:13,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652702529] [2025-04-29 11:26:13,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:13,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:26:13,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:13,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:26:13,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=439, Unknown=1, NotChecked=42, Total=552 [2025-04-29 11:26:13,184 INFO L87 Difference]: Start difference. First operand 254 states and 289 transitions. Second operand has 24 states, 23 states have (on average 5.173913043478261) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:13,665 INFO L93 Difference]: Finished difference Result 305 states and 338 transitions. [2025-04-29 11:26:13,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:26:13,666 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.173913043478261) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-04-29 11:26:13,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:13,667 INFO L225 Difference]: With dead ends: 305 [2025-04-29 11:26:13,667 INFO L226 Difference]: Without dead ends: 305 [2025-04-29 11:26:13,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=758, Unknown=1, NotChecked=58, Total=992 [2025-04-29 11:26:13,667 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:13,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 674 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 728 Invalid, 0 Unknown, 131 Unchecked, 0.3s Time] [2025-04-29 11:26:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-04-29 11:26:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 270. [2025-04-29 11:26:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 259 states have (on average 1.1814671814671815) internal successors, (306), 269 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 306 transitions. [2025-04-29 11:26:13,671 INFO L79 Accepts]: Start accepts. Automaton has 270 states and 306 transitions. Word has length 46 [2025-04-29 11:26:13,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:13,671 INFO L485 AbstractCegarLoop]: Abstraction has 270 states and 306 transitions. [2025-04-29 11:26:13,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.173913043478261) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:13,671 INFO L278 IsEmpty]: Start isEmpty. Operand 270 states and 306 transitions. [2025-04-29 11:26:13,671 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:26:13,671 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:13,672 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:13,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:26:13,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:13,872 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:26:13,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1399310739, now seen corresponding path program 1 times [2025-04-29 11:26:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:13,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980045103] [2025-04-29 11:26:13,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:13,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:26:13,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:26:13,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:13,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:13,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980045103] [2025-04-29 11:26:13,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980045103] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:13,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911777727] [2025-04-29 11:26:13,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:13,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:13,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:13,983 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:13,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:26:14,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:26:14,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:26:14,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:14,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:14,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:26:14,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:14,240 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:26:14,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:26:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:26:14,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:26:14,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911777727] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:14,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:14,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-04-29 11:26:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162802413] [2025-04-29 11:26:14,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:14,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:26:14,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:14,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:26:14,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:26:14,337 INFO L87 Difference]: Start difference. First operand 270 states and 306 transitions. Second operand has 18 states, 17 states have (on average 5.647058823529412) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:14,642 INFO L93 Difference]: Finished difference Result 284 states and 313 transitions. [2025-04-29 11:26:14,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:26:14,642 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.647058823529412) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-29 11:26:14,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:14,643 INFO L225 Difference]: With dead ends: 284 [2025-04-29 11:26:14,643 INFO L226 Difference]: Without dead ends: 284 [2025-04-29 11:26:14,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:26:14,643 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 78 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:14,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 233 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:26:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-29 11:26:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2025-04-29 11:26:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 252 states have (on average 1.1626984126984128) internal successors, (293), 261 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 293 transitions. [2025-04-29 11:26:14,646 INFO L79 Accepts]: Start accepts. Automaton has 262 states and 293 transitions. Word has length 47 [2025-04-29 11:26:14,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:14,646 INFO L485 AbstractCegarLoop]: Abstraction has 262 states and 293 transitions. [2025-04-29 11:26:14,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.647058823529412) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:14,647 INFO L278 IsEmpty]: Start isEmpty. Operand 262 states and 293 transitions. [2025-04-29 11:26:14,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:26:14,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:14,647 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:14,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:14,847 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,SelfDestructingSolverStorable38 [2025-04-29 11:26:14,848 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:26:14,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1523532019, now seen corresponding path program 1 times [2025-04-29 11:26:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:14,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192154355] [2025-04-29 11:26:14,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:14,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:14,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:26:14,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:26:14,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:14,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:15,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:15,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192154355] [2025-04-29 11:26:15,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192154355] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:15,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969987846] [2025-04-29 11:26:15,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:15,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:15,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:15,212 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:15,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:26:15,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:26:15,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:26:15,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:15,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:15,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-29 11:26:15,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:15,370 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:26:15,413 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:26:15,422 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:26:15,422 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:26:15,510 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-04-29 11:26:15,516 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-04-29 11:26:15,539 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:26:15,539 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-04-29 11:26:15,541 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-29 11:26:15,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 11:26:15,583 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2025-04-29 11:26:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:15,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:15,749 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_3030 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3030) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))) (forall ((v_ArrVal_3030 (Array Int Int)) (v_ArrVal_3031 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3030) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3031) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))))) is different from false [2025-04-29 11:26:15,753 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:15,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-04-29 11:26:15,759 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:15,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2025-04-29 11:26:15,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 7 treesize of output 3 [2025-04-29 11:26:15,772 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:15,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-04-29 11:26:15,776 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:15,776 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-04-29 11:26:15,778 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:26:15,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:26:15,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-04-29 11:26:15,781 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:26:15,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:26:15,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-04-29 11:26:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:15,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969987846] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:26:15,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:26:15,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2025-04-29 11:26:15,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75758597] [2025-04-29 11:26:15,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:26:15,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:26:15,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:15,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:26:15,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=575, Unknown=1, NotChecked=48, Total=702 [2025-04-29 11:26:15,914 INFO L87 Difference]: Start difference. First operand 262 states and 293 transitions. Second operand has 27 states, 26 states have (on average 4.8076923076923075) internal successors, (125), 27 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:26:16,733 INFO L93 Difference]: Finished difference Result 345 states and 379 transitions. [2025-04-29 11:26:16,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 11:26:16,734 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.8076923076923075) internal successors, (125), 27 states have internal predecessors, (125), 0 states have call successors, (0), 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 48 [2025-04-29 11:26:16,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:26:16,735 INFO L225 Difference]: With dead ends: 345 [2025-04-29 11:26:16,735 INFO L226 Difference]: Without dead ends: 345 [2025-04-29 11:26:16,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=324, Invalid=1935, Unknown=1, NotChecked=92, Total=2352 [2025-04-29 11:26:16,735 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 350 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:26:16,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 898 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1297 Invalid, 0 Unknown, 232 Unchecked, 0.5s Time] [2025-04-29 11:26:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-04-29 11:26:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 307. [2025-04-29 11:26:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 297 states have (on average 1.1919191919191918) internal successors, (354), 306 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 354 transitions. [2025-04-29 11:26:16,739 INFO L79 Accepts]: Start accepts. Automaton has 307 states and 354 transitions. Word has length 48 [2025-04-29 11:26:16,739 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:26:16,739 INFO L485 AbstractCegarLoop]: Abstraction has 307 states and 354 transitions. [2025-04-29 11:26:16,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.8076923076923075) internal successors, (125), 27 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:26:16,740 INFO L278 IsEmpty]: Start isEmpty. Operand 307 states and 354 transitions. [2025-04-29 11:26:16,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:26:16,740 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:26:16,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:16,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:16,941 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,SelfDestructingSolverStorable39 [2025-04-29 11:26:16,941 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-04-29 11:26:16,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash 412860662, now seen corresponding path program 1 times [2025-04-29 11:26:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:16,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540268927] [2025-04-29 11:26:16,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:16,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:26:16,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:26:16,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:16,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:17,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540268927] [2025-04-29 11:26:17,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540268927] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:26:17,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421228629] [2025-04-29 11:26:17,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:17,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:17,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:17,604 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:17,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:26:17,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:26:17,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:26:17,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:17,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:17,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-04-29 11:26:17,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:17,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:26:17,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:26:17,793 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:26:17,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:26:17,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:26:17,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:26:17,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:26:17,887 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-04-29 11:26:17,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:26:17,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-04-29 11:26:17,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-04-29 11:26:17,993 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:26:17,993 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:26:18,082 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-04-29 11:26:18,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2025-04-29 11:26:18,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:26:18,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:26:18,224 INFO L325 Elim1Store]: treesize reduction 62, result has 25.3 percent of original size [2025-04-29 11:26:18,224 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 84 [2025-04-29 11:26:18,251 INFO L325 Elim1Store]: treesize reduction 72, result has 30.8 percent of original size [2025-04-29 11:26:18,251 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 54 [2025-04-29 11:26:18,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2025-04-29 11:26:18,360 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 69 [2025-04-29 11:26:18,362 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 5 treesize of output 3 [2025-04-29 11:26:18,365 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 58 treesize of output 52 [2025-04-29 11:26:18,411 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2025-04-29 11:26:18,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-04-29 11:26:18,434 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2025-04-29 11:26:18,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2025-04-29 11:26:18,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:26:18,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:26:18,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 38 [2025-04-29 11:26:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:26:18,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:26:18,891 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (forall ((v_ArrVal_3188 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3188) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_3189 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3189) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))) is different from false [2025-04-29 11:26:31,558 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse2 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem5#1.offset_22| Int)) (or (forall ((v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3184 Int)) (= (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 (store (select |c_#memory_$Pointer$#0.offset| .cse0) (+ |v_ULTIMATE.start_main_#t~mem5#1.offset_22| 4) v_ArrVal_3184)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3189) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (< .cse2 |v_ULTIMATE.start_main_#t~mem5#1.offset_22|))) (forall ((|v_ULTIMATE.start_main_#t~mem5#1.offset_22| Int)) (or (forall ((v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3185 Int)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| .cse0 (store (select |c_#memory_$Pointer$#0.base| .cse0) (+ |v_ULTIMATE.start_main_#t~mem5#1.offset_22| 4) v_ArrVal_3185)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3188) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (< .cse2 |v_ULTIMATE.start_main_#t~mem5#1.offset_22|))))) is different from false Killed by 15