./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr.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-ext/tree_cnstr.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 fad55b50641594a03c921912a7a931fab5e992bfeceb90767fe63ab12a1ef575 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:22:45,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:22:45,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:22:45,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:22:45,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:22:45,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:22:45,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:22:45,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:22:45,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:22:45,119 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:22:45,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:22:45,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:22:45,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:22:45,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:22:45,120 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:22:45,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:22:45,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:22:45,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:22:45,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:22:45,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:22:45,120 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:22:45,120 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:22:45,120 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:22:45,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:22:45,121 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:22:45,121 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:22:45,121 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:22:45,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:22:45,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:22:45,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:22:45,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:45,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:45,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:45,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:45,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:22:45,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:45,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:45,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:45,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:45,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:22:45,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:22:45,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:22:45,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:22:45,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:22:45,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:22:45,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:22:45,123 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 -> fad55b50641594a03c921912a7a931fab5e992bfeceb90767fe63ab12a1ef575 [2025-04-29 11:22:45,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:22:45,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:22:45,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:22:45,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:22:45,375 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:22:45,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr.c [2025-04-29 11:22:46,717 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb7847f2/fe68c9d4b65f446ebbbd4d3179b7a96c/FLAG61e4ca9a3 [2025-04-29 11:22:46,917 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:22:46,918 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext/tree_cnstr.c [2025-04-29 11:22:46,919 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:46,919 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:46,925 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb7847f2/fe68c9d4b65f446ebbbd4d3179b7a96c/FLAG61e4ca9a3 [2025-04-29 11:22:47,718 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb7847f2/fe68c9d4b65f446ebbbd4d3179b7a96c [2025-04-29 11:22:47,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:22:47,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:22:47,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:47,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:22:47,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:22:47,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:47,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475c5b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47, skipping insertion in model container [2025-04-29 11:22:47,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:47,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:22:47,889 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:47,896 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:22:47,921 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:47,931 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:22:47,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47 WrapperNode [2025-04-29 11:22:47,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:47,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:47,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:22:47,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:22:47,937 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:22:47" (1/1) ... [2025-04-29 11:22:47,944 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:22:47" (1/1) ... [2025-04-29 11:22:47,964 INFO L138 Inliner]: procedures = 10, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2025-04-29 11:22:47,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:47,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:22:47,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:22:47,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:22:47,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:47,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:47,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:47,998 INFO L175 MemorySlicer]: Split 26 memory accesses to 1 slices as follows [26]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2025-04-29 11:22:47,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:47,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:48,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:48,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:48,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:48,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:48,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:48,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:22:48,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:22:48,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:22:48,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:22:48,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (1/1) ... [2025-04-29 11:22:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:48,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:48,036 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:22:48,041 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:22:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:22:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:22:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:22:48,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:22:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:22:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:22:48,112 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:22:48,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:22:48,396 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2025-04-29 11:22:48,396 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:22:48,409 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:22:48,409 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-29 11:22:48,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:48 BoogieIcfgContainer [2025-04-29 11:22:48,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:22:48,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:22:48,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:22:48,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:22:48,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:22:47" (1/3) ... [2025-04-29 11:22:48,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aff6b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:48, skipping insertion in model container [2025-04-29 11:22:48,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:47" (2/3) ... [2025-04-29 11:22:48,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aff6b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:48, skipping insertion in model container [2025-04-29 11:22:48,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:48" (3/3) ... [2025-04-29 11:22:48,416 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_cnstr.c [2025-04-29 11:22:48,426 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:22:48,428 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_cnstr.c that has 1 procedures, 125 locations, 141 edges, 1 initial locations, 4 loop locations, and 56 error locations. [2025-04-29 11:22:48,461 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:22:48,468 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;@3a94455e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:22:48,468 INFO L341 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-04-29 11:22:48,471 INFO L278 IsEmpty]: Start isEmpty. Operand has 125 states, 68 states have (on average 2.073529411764706) internal successors, (141), 124 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:22:48,474 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-29 11:22:48,474 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:48,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-29 11:22:48,475 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:48,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2025-04-29 11:22:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:48,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142782065] [2025-04-29 11:22:48,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:48,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:22:48,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:22:48,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:48,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:48,600 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:22:48,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:48,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142782065] [2025-04-29 11:22:48,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142782065] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:48,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:48,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:48,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217030578] [2025-04-29 11:22:48,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:48,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:48,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:48,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:48,619 INFO L87 Difference]: Start difference. First operand has 125 states, 68 states have (on average 2.073529411764706) internal successors, (141), 124 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:48,754 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2025-04-29 11:22:48,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:48,756 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-04-29 11:22:48,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:48,761 INFO L225 Difference]: With dead ends: 164 [2025-04-29 11:22:48,761 INFO L226 Difference]: Without dead ends: 162 [2025-04-29 11:22:48,762 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:22:48,764 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:48,764 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 110 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-04-29 11:22:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 121. [2025-04-29 11:22:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 67 states have (on average 2.0) internal successors, (134), 120 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2025-04-29 11:22:48,797 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 3 [2025-04-29 11:22:48,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:48,797 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2025-04-29 11:22:48,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:48,798 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2025-04-29 11:22:48,798 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-29 11:22:48,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:48,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-29 11:22:48,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:22:48,798 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:48,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-04-29 11:22:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:48,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952645166] [2025-04-29 11:22:48,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:48,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:22:48,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:22:48,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:48,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:48,890 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:22:48,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:48,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952645166] [2025-04-29 11:22:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952645166] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:48,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:48,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252399254] [2025-04-29 11:22:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:48,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:48,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:48,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:48,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:48,893 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:48,982 INFO L93 Difference]: Finished difference Result 160 states and 179 transitions. [2025-04-29 11:22:48,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:48,982 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-04-29 11:22:48,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:48,983 INFO L225 Difference]: With dead ends: 160 [2025-04-29 11:22:48,983 INFO L226 Difference]: Without dead ends: 160 [2025-04-29 11:22:48,984 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:22:48,984 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 125 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:48,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 113 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-29 11:22:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 119. [2025-04-29 11:22:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 118 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2025-04-29 11:22:48,989 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 3 [2025-04-29 11:22:48,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:48,989 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2025-04-29 11:22:48,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:48,989 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2025-04-29 11:22:48,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:22:48,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:48,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:48,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:22:48,989 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:48,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:48,990 INFO L85 PathProgramCache]: Analyzing trace with hash 59353998, now seen corresponding path program 1 times [2025-04-29 11:22:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:48,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515711421] [2025-04-29 11:22:48,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:48,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:22:49,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:22:49,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:49,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:49,044 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:22:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:49,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515711421] [2025-04-29 11:22:49,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515711421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:49,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:49,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:49,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107072147] [2025-04-29 11:22:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:49,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:49,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:49,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:49,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:49,045 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:49,188 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2025-04-29 11:22:49,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:49,188 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-29 11:22:49,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:49,190 INFO L225 Difference]: With dead ends: 148 [2025-04-29 11:22:49,192 INFO L226 Difference]: Without dead ends: 148 [2025-04-29 11:22:49,192 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:22:49,192 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 206 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:49,193 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 82 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-04-29 11:22:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2025-04-29 11:22:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 70 states have (on average 1.7428571428571429) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2025-04-29 11:22:49,202 INFO L79 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 8 [2025-04-29 11:22:49,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:49,204 INFO L485 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2025-04-29 11:22:49,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,204 INFO L278 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2025-04-29 11:22:49,204 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:22:49,204 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:49,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:49,204 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:22:49,205 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:49,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:49,206 INFO L85 PathProgramCache]: Analyzing trace with hash 59353999, now seen corresponding path program 1 times [2025-04-29 11:22:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:49,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495005908] [2025-04-29 11:22:49,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:49,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:22:49,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:22:49,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:49,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:49,326 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:22:49,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:49,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495005908] [2025-04-29 11:22:49,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495005908] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:49,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:49,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:49,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508564139] [2025-04-29 11:22:49,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:49,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:49,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:49,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:49,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:49,327 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:49,508 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2025-04-29 11:22:49,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:49,508 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-29 11:22:49,508 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:49,509 INFO L225 Difference]: With dead ends: 210 [2025-04-29 11:22:49,509 INFO L226 Difference]: Without dead ends: 210 [2025-04-29 11:22:49,509 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:22:49,510 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 246 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:49,510 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 137 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-29 11:22:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 177. [2025-04-29 11:22:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.673758865248227) internal successors, (236), 176 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 236 transitions. [2025-04-29 11:22:49,516 INFO L79 Accepts]: Start accepts. Automaton has 177 states and 236 transitions. Word has length 8 [2025-04-29 11:22:49,516 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:49,516 INFO L485 AbstractCegarLoop]: Abstraction has 177 states and 236 transitions. [2025-04-29 11:22:49,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,516 INFO L278 IsEmpty]: Start isEmpty. Operand 177 states and 236 transitions. [2025-04-29 11:22:49,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:22:49,516 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:49,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:49,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:22:49,516 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:49,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1840148059, now seen corresponding path program 1 times [2025-04-29 11:22:49,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:49,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666142383] [2025-04-29 11:22:49,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:49,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:22:49,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:22:49,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:49,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:49,549 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:22:49,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:49,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666142383] [2025-04-29 11:22:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666142383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:49,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149180430] [2025-04-29 11:22:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:49,550 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:49,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:49,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:49,551 INFO L87 Difference]: Start difference. First operand 177 states and 236 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:49,562 INFO L93 Difference]: Finished difference Result 191 states and 234 transitions. [2025-04-29 11:22:49,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:49,563 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-04-29 11:22:49,563 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:49,563 INFO L225 Difference]: With dead ends: 191 [2025-04-29 11:22:49,563 INFO L226 Difference]: Without dead ends: 191 [2025-04-29 11:22:49,563 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:22:49,564 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 106 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:49,564 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-04-29 11:22:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 177. [2025-04-29 11:22:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.6595744680851063) internal successors, (234), 176 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2025-04-29 11:22:49,569 INFO L79 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 9 [2025-04-29 11:22:49,569 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:49,569 INFO L485 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2025-04-29 11:22:49,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,569 INFO L278 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2025-04-29 11:22:49,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:22:49,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:49,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:49,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:22:49,570 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:49,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1195098080, now seen corresponding path program 1 times [2025-04-29 11:22:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:49,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444471432] [2025-04-29 11:22:49,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:49,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:49,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:49,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:49,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:49,603 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:22:49,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:49,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444471432] [2025-04-29 11:22:49,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444471432] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:49,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:49,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:49,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88956549] [2025-04-29 11:22:49,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:49,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:49,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:49,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:49,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:49,604 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:49,612 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2025-04-29 11:22:49,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:49,612 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:22:49,612 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:49,613 INFO L225 Difference]: With dead ends: 180 [2025-04-29 11:22:49,613 INFO L226 Difference]: Without dead ends: 180 [2025-04-29 11:22:49,613 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:22:49,613 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:49,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-04-29 11:22:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-04-29 11:22:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 144 states have (on average 1.6458333333333333) internal successors, (237), 179 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 237 transitions. [2025-04-29 11:22:49,621 INFO L79 Accepts]: Start accepts. Automaton has 180 states and 237 transitions. Word has length 14 [2025-04-29 11:22:49,621 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:49,622 INFO L485 AbstractCegarLoop]: Abstraction has 180 states and 237 transitions. [2025-04-29 11:22:49,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,622 INFO L278 IsEmpty]: Start isEmpty. Operand 180 states and 237 transitions. [2025-04-29 11:22:49,622 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:22:49,622 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:49,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:49,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:22:49,622 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:49,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1684983845, now seen corresponding path program 1 times [2025-04-29 11:22:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:49,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873545191] [2025-04-29 11:22:49,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:49,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:49,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:49,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:49,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:49,677 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:22:49,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:49,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873545191] [2025-04-29 11:22:49,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873545191] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:49,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:49,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:49,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187777805] [2025-04-29 11:22:49,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:49,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:49,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:49,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:49,679 INFO L87 Difference]: Start difference. First operand 180 states and 237 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:49,695 INFO L93 Difference]: Finished difference Result 187 states and 238 transitions. [2025-04-29 11:22:49,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:49,695 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:22:49,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:49,696 INFO L225 Difference]: With dead ends: 187 [2025-04-29 11:22:49,696 INFO L226 Difference]: Without dead ends: 187 [2025-04-29 11:22:49,696 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:22:49,696 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 5 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:49,697 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 219 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-04-29 11:22:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 182. [2025-04-29 11:22:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 146 states have (on average 1.6164383561643836) internal successors, (236), 181 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 236 transitions. [2025-04-29 11:22:49,704 INFO L79 Accepts]: Start accepts. Automaton has 182 states and 236 transitions. Word has length 16 [2025-04-29 11:22:49,704 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:49,704 INFO L485 AbstractCegarLoop]: Abstraction has 182 states and 236 transitions. [2025-04-29 11:22:49,704 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,704 INFO L278 IsEmpty]: Start isEmpty. Operand 182 states and 236 transitions. [2025-04-29 11:22:49,704 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:22:49,704 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:49,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:49,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:22:49,704 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:49,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -675554533, now seen corresponding path program 1 times [2025-04-29 11:22:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:49,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215771357] [2025-04-29 11:22:49,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:49,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:49,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:49,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:49,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:49,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:49,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:49,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215771357] [2025-04-29 11:22:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215771357] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899012651] [2025-04-29 11:22:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:49,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:49,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:49,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:49,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:49,735 INFO L87 Difference]: Start difference. First operand 182 states and 236 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:49,743 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2025-04-29 11:22:49,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:49,744 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:22:49,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:49,745 INFO L225 Difference]: With dead ends: 184 [2025-04-29 11:22:49,745 INFO L226 Difference]: Without dead ends: 184 [2025-04-29 11:22:49,745 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:22:49,746 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:49,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-04-29 11:22:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-04-29 11:22:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 148 states have (on average 1.6081081081081081) internal successors, (238), 183 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 238 transitions. [2025-04-29 11:22:49,752 INFO L79 Accepts]: Start accepts. Automaton has 184 states and 238 transitions. Word has length 16 [2025-04-29 11:22:49,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:49,752 INFO L485 AbstractCegarLoop]: Abstraction has 184 states and 238 transitions. [2025-04-29 11:22:49,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,752 INFO L278 IsEmpty]: Start isEmpty. Operand 184 states and 238 transitions. [2025-04-29 11:22:49,752 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:22:49,752 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:49,752 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:22:49,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:22:49,752 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:49,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:49,753 INFO L85 PathProgramCache]: Analyzing trace with hash -694874544, now seen corresponding path program 1 times [2025-04-29 11:22:49,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:49,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550434104] [2025-04-29 11:22:49,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:49,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:22:49,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:22:49,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:49,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:49,805 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:22:49,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:49,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550434104] [2025-04-29 11:22:49,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550434104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:49,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:49,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756235995] [2025-04-29 11:22:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:49,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:49,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:49,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:49,807 INFO L87 Difference]: Start difference. First operand 184 states and 238 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:49,889 INFO L93 Difference]: Finished difference Result 210 states and 245 transitions. [2025-04-29 11:22:49,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:49,889 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:22:49,890 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:49,890 INFO L225 Difference]: With dead ends: 210 [2025-04-29 11:22:49,890 INFO L226 Difference]: Without dead ends: 210 [2025-04-29 11:22:49,891 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:22:49,891 INFO L437 NwaCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:49,891 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 197 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-29 11:22:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 185. [2025-04-29 11:22:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 149 states have (on average 1.604026845637584) internal successors, (239), 184 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 239 transitions. [2025-04-29 11:22:49,896 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 239 transitions. Word has length 17 [2025-04-29 11:22:49,896 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:49,896 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 239 transitions. [2025-04-29 11:22:49,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:49,896 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 239 transitions. [2025-04-29 11:22:49,897 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:49,897 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:49,897 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:22:49,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:22:49,897 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:49,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1403581215, now seen corresponding path program 1 times [2025-04-29 11:22:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:49,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028575564] [2025-04-29 11:22:49,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:49,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:49,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:49,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:49,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:49,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:50,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028575564] [2025-04-29 11:22:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028575564] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:50,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:50,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:22:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784131537] [2025-04-29 11:22:50,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:50,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:50,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:50,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:50,060 INFO L87 Difference]: Start difference. First operand 185 states and 239 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:22:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:50,243 INFO L93 Difference]: Finished difference Result 306 states and 384 transitions. [2025-04-29 11:22:50,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:50,244 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:22:50,244 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:50,245 INFO L225 Difference]: With dead ends: 306 [2025-04-29 11:22:50,245 INFO L226 Difference]: Without dead ends: 306 [2025-04-29 11:22:50,245 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:50,246 INFO L437 NwaCegarLoop]: 99 mSDtfsCounter, 158 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:50,246 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 434 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-29 11:22:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 265. [2025-04-29 11:22:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 229 states have (on average 1.5851528384279476) internal successors, (363), 264 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 363 transitions. [2025-04-29 11:22:50,250 INFO L79 Accepts]: Start accepts. Automaton has 265 states and 363 transitions. Word has length 18 [2025-04-29 11:22:50,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:50,251 INFO L485 AbstractCegarLoop]: Abstraction has 265 states and 363 transitions. [2025-04-29 11:22:50,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:22:50,251 INFO L278 IsEmpty]: Start isEmpty. Operand 265 states and 363 transitions. [2025-04-29 11:22:50,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:50,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:50,251 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:22:50,251 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:22:50,251 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:50,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:50,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1880049384, now seen corresponding path program 1 times [2025-04-29 11:22:50,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:50,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176490127] [2025-04-29 11:22:50,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:50,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:50,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:50,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:50,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:50,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:50,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:50,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176490127] [2025-04-29 11:22:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176490127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:50,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:22:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354107150] [2025-04-29 11:22:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:50,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:50,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:50,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:50,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:50,399 INFO L87 Difference]: Start difference. First operand 265 states and 363 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:22:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:50,570 INFO L93 Difference]: Finished difference Result 267 states and 335 transitions. [2025-04-29 11:22:50,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:22:50,570 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:22:50,571 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:50,571 INFO L225 Difference]: With dead ends: 267 [2025-04-29 11:22:50,572 INFO L226 Difference]: Without dead ends: 267 [2025-04-29 11:22:50,572 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:22:50,572 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 108 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:50,573 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 435 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-04-29 11:22:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 237. [2025-04-29 11:22:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 201 states have (on average 1.5820895522388059) internal successors, (318), 236 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 318 transitions. [2025-04-29 11:22:50,579 INFO L79 Accepts]: Start accepts. Automaton has 237 states and 318 transitions. Word has length 18 [2025-04-29 11:22:50,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:50,580 INFO L485 AbstractCegarLoop]: Abstraction has 237 states and 318 transitions. [2025-04-29 11:22:50,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:22:50,580 INFO L278 IsEmpty]: Start isEmpty. Operand 237 states and 318 transitions. [2025-04-29 11:22:50,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:22:50,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:50,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:50,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:22:50,582 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:50,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:50,582 INFO L85 PathProgramCache]: Analyzing trace with hash 940746083, now seen corresponding path program 1 times [2025-04-29 11:22:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:50,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479360210] [2025-04-29 11:22:50,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:50,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:22:50,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:22:50,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:50,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:50,654 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:22:50,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:50,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479360210] [2025-04-29 11:22:50,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479360210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:50,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:50,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:50,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490195217] [2025-04-29 11:22:50,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:50,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:50,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:50,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:50,655 INFO L87 Difference]: Start difference. First operand 237 states and 318 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:50,758 INFO L93 Difference]: Finished difference Result 236 states and 316 transitions. [2025-04-29 11:22:50,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:50,758 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:22:50,758 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:50,759 INFO L225 Difference]: With dead ends: 236 [2025-04-29 11:22:50,759 INFO L226 Difference]: Without dead ends: 236 [2025-04-29 11:22:50,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:50,760 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 3 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:50,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 296 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-29 11:22:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-04-29 11:22:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 201 states have (on average 1.572139303482587) internal successors, (316), 235 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 316 transitions. [2025-04-29 11:22:50,764 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 316 transitions. Word has length 19 [2025-04-29 11:22:50,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:50,765 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 316 transitions. [2025-04-29 11:22:50,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:50,765 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 316 transitions. [2025-04-29 11:22:50,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:22:50,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:50,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:50,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:22:50,768 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:50,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 940746084, now seen corresponding path program 1 times [2025-04-29 11:22:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:50,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100244438] [2025-04-29 11:22:50,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:50,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:22:50,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:22:50,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:50,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:50,917 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:22:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:50,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100244438] [2025-04-29 11:22:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100244438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349985439] [2025-04-29 11:22:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:50,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:50,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:50,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:50,918 INFO L87 Difference]: Start difference. First operand 236 states and 316 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:51,030 INFO L93 Difference]: Finished difference Result 235 states and 314 transitions. [2025-04-29 11:22:51,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:51,030 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:22:51,031 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:51,031 INFO L225 Difference]: With dead ends: 235 [2025-04-29 11:22:51,031 INFO L226 Difference]: Without dead ends: 235 [2025-04-29 11:22:51,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:51,032 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:51,032 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 276 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:51,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-29 11:22:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-04-29 11:22:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 201 states have (on average 1.5621890547263682) internal successors, (314), 234 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 314 transitions. [2025-04-29 11:22:51,037 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 314 transitions. Word has length 19 [2025-04-29 11:22:51,037 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:51,037 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 314 transitions. [2025-04-29 11:22:51,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:51,037 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 314 transitions. [2025-04-29 11:22:51,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:22:51,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:51,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:51,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:22:51,038 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:51,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2069866268, now seen corresponding path program 1 times [2025-04-29 11:22:51,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:51,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543675530] [2025-04-29 11:22:51,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:51,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:51,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:22:51,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:22:51,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:51,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:51,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543675530] [2025-04-29 11:22:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543675530] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:51,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:51,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:22:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544986305] [2025-04-29 11:22:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:51,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:51,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:51,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:51,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:51,113 INFO L87 Difference]: Start difference. First operand 235 states and 314 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:22:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:51,222 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2025-04-29 11:22:51,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:22:51,222 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:22:51,222 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:51,223 INFO L225 Difference]: With dead ends: 250 [2025-04-29 11:22:51,223 INFO L226 Difference]: Without dead ends: 250 [2025-04-29 11:22:51,223 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:22:51,224 INFO L437 NwaCegarLoop]: 98 mSDtfsCounter, 29 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:51,224 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 282 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-04-29 11:22:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2025-04-29 11:22:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 212 states have (on average 1.5424528301886793) internal successors, (327), 245 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 327 transitions. [2025-04-29 11:22:51,228 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 327 transitions. Word has length 20 [2025-04-29 11:22:51,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:51,228 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 327 transitions. [2025-04-29 11:22:51,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:22:51,229 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2025-04-29 11:22:51,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:22:51,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:51,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:51,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:22:51,229 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:51,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2070050966, now seen corresponding path program 1 times [2025-04-29 11:22:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:51,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108179275] [2025-04-29 11:22:51,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:51,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:22:51,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:22:51,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:51,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:51,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108179275] [2025-04-29 11:22:51,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108179275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:51,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:51,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:22:51,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133569465] [2025-04-29 11:22:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:51,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:22:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:51,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:22:51,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:22:51,389 INFO L87 Difference]: Start difference. First operand 246 states and 327 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:22:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:51,641 INFO L93 Difference]: Finished difference Result 347 states and 432 transitions. [2025-04-29 11:22:51,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:22:51,641 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:22:51,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:51,642 INFO L225 Difference]: With dead ends: 347 [2025-04-29 11:22:51,642 INFO L226 Difference]: Without dead ends: 347 [2025-04-29 11:22:51,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:22:51,643 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 330 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:51,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 444 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-04-29 11:22:51,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 304. [2025-04-29 11:22:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 270 states have (on average 1.5185185185185186) internal successors, (410), 303 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 410 transitions. [2025-04-29 11:22:51,647 INFO L79 Accepts]: Start accepts. Automaton has 304 states and 410 transitions. Word has length 20 [2025-04-29 11:22:51,647 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:51,647 INFO L485 AbstractCegarLoop]: Abstraction has 304 states and 410 transitions. [2025-04-29 11:22:51,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:22:51,648 INFO L278 IsEmpty]: Start isEmpty. Operand 304 states and 410 transitions. [2025-04-29 11:22:51,648 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:22:51,648 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:51,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:51,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:22:51,648 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:51,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash 735061824, now seen corresponding path program 1 times [2025-04-29 11:22:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:51,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126450532] [2025-04-29 11:22:51,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:51,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:22:51,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:22:51,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:51,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:51,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126450532] [2025-04-29 11:22:51,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126450532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:51,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664561398] [2025-04-29 11:22:51,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:51,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:51,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:51,712 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:22:51,713 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:22:51,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:22:51,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:22:51,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:51,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:51,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:22:51,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:51,817 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:22:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664561398] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:51,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:51,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-29 11:22:51,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136979747] [2025-04-29 11:22:51,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:51,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:51,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:51,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:51,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:51,875 INFO L87 Difference]: Start difference. First operand 304 states and 410 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:51,996 INFO L93 Difference]: Finished difference Result 364 states and 482 transitions. [2025-04-29 11:22:51,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:22:51,997 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:22:51,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:51,999 INFO L225 Difference]: With dead ends: 364 [2025-04-29 11:22:51,999 INFO L226 Difference]: Without dead ends: 363 [2025-04-29 11:22:51,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:22:52,000 INFO L437 NwaCegarLoop]: 103 mSDtfsCounter, 121 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:52,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 295 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-04-29 11:22:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 312. [2025-04-29 11:22:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 278 states have (on average 1.5035971223021583) internal successors, (418), 311 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 418 transitions. [2025-04-29 11:22:52,005 INFO L79 Accepts]: Start accepts. Automaton has 312 states and 418 transitions. Word has length 20 [2025-04-29 11:22:52,005 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:52,005 INFO L485 AbstractCegarLoop]: Abstraction has 312 states and 418 transitions. [2025-04-29 11:22:52,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:52,006 INFO L278 IsEmpty]: Start isEmpty. Operand 312 states and 418 transitions. [2025-04-29 11:22:52,006 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:22:52,006 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:52,007 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:22:52,013 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:22:52,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:22:52,212 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:52,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash 735059491, now seen corresponding path program 1 times [2025-04-29 11:22:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:52,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746060844] [2025-04-29 11:22:52,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:52,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:22:52,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:22:52,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:52,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:52,239 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:22:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:52,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746060844] [2025-04-29 11:22:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746060844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:52,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655743283] [2025-04-29 11:22:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:52,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:52,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:52,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:52,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:52,240 INFO L87 Difference]: Start difference. First operand 312 states and 418 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:22:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:52,247 INFO L93 Difference]: Finished difference Result 285 states and 364 transitions. [2025-04-29 11:22:52,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:52,247 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:22:52,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:52,248 INFO L225 Difference]: With dead ends: 285 [2025-04-29 11:22:52,248 INFO L226 Difference]: Without dead ends: 272 [2025-04-29 11:22:52,248 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:22:52,248 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 2 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:52,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-29 11:22:52,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2025-04-29 11:22:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 236 states have (on average 1.4872881355932204) internal successors, (351), 269 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 351 transitions. [2025-04-29 11:22:52,252 INFO L79 Accepts]: Start accepts. Automaton has 270 states and 351 transitions. Word has length 20 [2025-04-29 11:22:52,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:52,252 INFO L485 AbstractCegarLoop]: Abstraction has 270 states and 351 transitions. [2025-04-29 11:22:52,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:22:52,252 INFO L278 IsEmpty]: Start isEmpty. Operand 270 states and 351 transitions. [2025-04-29 11:22:52,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:22:52,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:52,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:52,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:22:52,253 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:52,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1105005910, now seen corresponding path program 1 times [2025-04-29 11:22:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:52,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384382270] [2025-04-29 11:22:52,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:52,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:22:52,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:22:52,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:52,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:52,369 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:22:52,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:52,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384382270] [2025-04-29 11:22:52,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384382270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:52,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:52,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:22:52,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316671171] [2025-04-29 11:22:52,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:52,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:22:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:52,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:22:52,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:52,370 INFO L87 Difference]: Start difference. First operand 270 states and 351 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:52,536 INFO L93 Difference]: Finished difference Result 277 states and 357 transitions. [2025-04-29 11:22:52,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:52,537 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-29 11:22:52,537 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:52,537 INFO L225 Difference]: With dead ends: 277 [2025-04-29 11:22:52,537 INFO L226 Difference]: Without dead ends: 277 [2025-04-29 11:22:52,538 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:52,538 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 67 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:52,538 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 219 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-04-29 11:22:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 269. [2025-04-29 11:22:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 236 states have (on average 1.4745762711864407) internal successors, (348), 268 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 348 transitions. [2025-04-29 11:22:52,542 INFO L79 Accepts]: Start accepts. Automaton has 269 states and 348 transitions. Word has length 22 [2025-04-29 11:22:52,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:52,542 INFO L485 AbstractCegarLoop]: Abstraction has 269 states and 348 transitions. [2025-04-29 11:22:52,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:52,542 INFO L278 IsEmpty]: Start isEmpty. Operand 269 states and 348 transitions. [2025-04-29 11:22:52,543 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:22:52,543 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:52,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:52,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:22:52,543 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:52,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1105005911, now seen corresponding path program 1 times [2025-04-29 11:22:52,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:52,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618449509] [2025-04-29 11:22:52,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:52,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:52,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:22:52,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:22:52,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:52,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:52,701 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:22:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:52,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618449509] [2025-04-29 11:22:52,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618449509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:52,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:52,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:22:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703695685] [2025-04-29 11:22:52,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:52,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:22:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:52,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:22:52,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:52,703 INFO L87 Difference]: Start difference. First operand 269 states and 348 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:52,890 INFO L93 Difference]: Finished difference Result 276 states and 354 transitions. [2025-04-29 11:22:52,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:52,891 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-29 11:22:52,891 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:52,892 INFO L225 Difference]: With dead ends: 276 [2025-04-29 11:22:52,892 INFO L226 Difference]: Without dead ends: 276 [2025-04-29 11:22:52,893 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:22:52,893 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 64 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:52,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 213 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-04-29 11:22:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 268. [2025-04-29 11:22:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 236 states have (on average 1.4618644067796611) internal successors, (345), 267 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 345 transitions. [2025-04-29 11:22:52,898 INFO L79 Accepts]: Start accepts. Automaton has 268 states and 345 transitions. Word has length 22 [2025-04-29 11:22:52,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:52,898 INFO L485 AbstractCegarLoop]: Abstraction has 268 states and 345 transitions. [2025-04-29 11:22:52,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:52,898 INFO L278 IsEmpty]: Start isEmpty. Operand 268 states and 345 transitions. [2025-04-29 11:22:52,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:22:52,898 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:52,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:52,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:22:52,898 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:52,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:52,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1808663744, now seen corresponding path program 1 times [2025-04-29 11:22:52,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:52,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998379172] [2025-04-29 11:22:52,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:52,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:52,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:22:52,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:22:52,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:52,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:52,971 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:22:52,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:52,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998379172] [2025-04-29 11:22:52,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998379172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:52,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:52,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:52,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127035942] [2025-04-29 11:22:52,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:52,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:52,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:52,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:52,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:52,972 INFO L87 Difference]: Start difference. First operand 268 states and 345 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,062 INFO L93 Difference]: Finished difference Result 267 states and 343 transitions. [2025-04-29 11:22:53,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:53,062 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:22:53,062 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,063 INFO L225 Difference]: With dead ends: 267 [2025-04-29 11:22:53,063 INFO L226 Difference]: Without dead ends: 267 [2025-04-29 11:22:53,063 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:53,063 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 286 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-04-29 11:22:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-04-29 11:22:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 236 states have (on average 1.4533898305084745) internal successors, (343), 266 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 343 transitions. [2025-04-29 11:22:53,067 INFO L79 Accepts]: Start accepts. Automaton has 267 states and 343 transitions. Word has length 23 [2025-04-29 11:22:53,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,067 INFO L485 AbstractCegarLoop]: Abstraction has 267 states and 343 transitions. [2025-04-29 11:22:53,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,068 INFO L278 IsEmpty]: Start isEmpty. Operand 267 states and 343 transitions. [2025-04-29 11:22:53,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:22:53,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:53,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:22:53,068 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:53,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1808663743, now seen corresponding path program 1 times [2025-04-29 11:22:53,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170883825] [2025-04-29 11:22:53,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:22:53,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:22:53,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,152 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:22:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170883825] [2025-04-29 11:22:53,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170883825] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:53,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114277470] [2025-04-29 11:22:53,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:53,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:53,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:53,154 INFO L87 Difference]: Start difference. First operand 267 states and 343 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,263 INFO L93 Difference]: Finished difference Result 266 states and 341 transitions. [2025-04-29 11:22:53,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:53,263 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:22:53,263 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,264 INFO L225 Difference]: With dead ends: 266 [2025-04-29 11:22:53,264 INFO L226 Difference]: Without dead ends: 266 [2025-04-29 11:22:53,264 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:53,264 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,264 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 266 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-04-29 11:22:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-04-29 11:22:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 236 states have (on average 1.444915254237288) internal successors, (341), 265 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 341 transitions. [2025-04-29 11:22:53,269 INFO L79 Accepts]: Start accepts. Automaton has 266 states and 341 transitions. Word has length 23 [2025-04-29 11:22:53,269 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,269 INFO L485 AbstractCegarLoop]: Abstraction has 266 states and 341 transitions. [2025-04-29 11:22:53,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,269 INFO L278 IsEmpty]: Start isEmpty. Operand 266 states and 341 transitions. [2025-04-29 11:22:53,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:22:53,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:53,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:22:53,270 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:53,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1536781765, now seen corresponding path program 1 times [2025-04-29 11:22:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933722076] [2025-04-29 11:22:53,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:22:53,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:22:53,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,368 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:22:53,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933722076] [2025-04-29 11:22:53,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933722076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:22:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976265529] [2025-04-29 11:22:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:22:53,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:22:53,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:53,369 INFO L87 Difference]: Start difference. First operand 266 states and 341 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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:22:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,543 INFO L93 Difference]: Finished difference Result 273 states and 349 transitions. [2025-04-29 11:22:53,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:53,543 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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:22:53,543 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,544 INFO L225 Difference]: With dead ends: 273 [2025-04-29 11:22:53,544 INFO L226 Difference]: Without dead ends: 273 [2025-04-29 11:22:53,544 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:22:53,545 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 56 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,545 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 249 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:53,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-04-29 11:22:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2025-04-29 11:22:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 236 states have (on average 1.4406779661016949) internal successors, (340), 264 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 340 transitions. [2025-04-29 11:22:53,550 INFO L79 Accepts]: Start accepts. Automaton has 265 states and 340 transitions. Word has length 26 [2025-04-29 11:22:53,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,550 INFO L485 AbstractCegarLoop]: Abstraction has 265 states and 340 transitions. [2025-04-29 11:22:53,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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:22:53,550 INFO L278 IsEmpty]: Start isEmpty. Operand 265 states and 340 transitions. [2025-04-29 11:22:53,551 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:22:53,551 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:53,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:22:53,551 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:53,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1536781764, now seen corresponding path program 1 times [2025-04-29 11:22:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338030589] [2025-04-29 11:22:53,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:22:53,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:22:53,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,725 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:22:53,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338030589] [2025-04-29 11:22:53,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338030589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:22:53,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499741632] [2025-04-29 11:22:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:22:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:22:53,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:22:53,727 INFO L87 Difference]: Start difference. First operand 265 states and 340 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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:22:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,922 INFO L93 Difference]: Finished difference Result 272 states and 348 transitions. [2025-04-29 11:22:53,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:53,923 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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:22:53,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,924 INFO L225 Difference]: With dead ends: 272 [2025-04-29 11:22:53,924 INFO L226 Difference]: Without dead ends: 272 [2025-04-29 11:22:53,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:22:53,925 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 56 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,925 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 245 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-29 11:22:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2025-04-29 11:22:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 236 states have (on average 1.4364406779661016) internal successors, (339), 263 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 339 transitions. [2025-04-29 11:22:53,929 INFO L79 Accepts]: Start accepts. Automaton has 264 states and 339 transitions. Word has length 26 [2025-04-29 11:22:53,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,929 INFO L485 AbstractCegarLoop]: Abstraction has 264 states and 339 transitions. [2025-04-29 11:22:53,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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:22:53,930 INFO L278 IsEmpty]: Start isEmpty. Operand 264 states and 339 transitions. [2025-04-29 11:22:53,930 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:22:53,930 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:53,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:22:53,931 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:22:53,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1312931134, now seen corresponding path program 1 times [2025-04-29 11:22:53,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040521950] [2025-04-29 11:22:53,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:22:53,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:22:53,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:54,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040521950] [2025-04-29 11:22:54,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040521950] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:54,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230109462] [2025-04-29 11:22:54,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:54,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:54,204 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:22:54,205 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:22:54,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:22:54,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:22:54,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-29 11:22:54,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:54,347 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:22:54,347 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:22:54,382 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:22:54,451 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:22:54,451 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:22:54,501 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:22:54,501 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:22:54,611 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:22:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:54,751 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_345 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_344))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_345)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2025-04-29 11:22:54,757 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_345 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_344))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_345)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2025-04-29 11:22:54,768 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:54,768 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 38 treesize of output 31 [2025-04-29 11:22:54,775 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:54,775 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 252 treesize of output 227 [2025-04-29 11:22:54,798 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 171 treesize of output 163 [2025-04-29 11:22:54,806 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:54,806 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 163 treesize of output 159 [2025-04-29 11:22:59,590 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:59,591 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 80 treesize of output 234 [2025-04-29 11:23:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:01,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230109462] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:01,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:01,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 28 [2025-04-29 11:23:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991089513] [2025-04-29 11:23:01,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 11:23:01,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:01,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 11:23:01,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=564, Unknown=12, NotChecked=102, Total=812 [2025-04-29 11:23:01,669 INFO L87 Difference]: Start difference. First operand 264 states and 339 transitions. Second operand has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:02,546 INFO L93 Difference]: Finished difference Result 464 states and 594 transitions. [2025-04-29 11:23:02,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:23:02,546 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 11:23:02,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:02,547 INFO L225 Difference]: With dead ends: 464 [2025-04-29 11:23:02,547 INFO L226 Difference]: Without dead ends: 464 [2025-04-29 11:23:02,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=231, Invalid=887, Unknown=12, NotChecked=130, Total=1260 [2025-04-29 11:23:02,548 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 524 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:02,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1030 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1425 Invalid, 0 Unknown, 678 Unchecked, 0.7s Time] [2025-04-29 11:23:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-04-29 11:23:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 328. [2025-04-29 11:23:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 300 states have (on average 1.4366666666666668) internal successors, (431), 327 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 431 transitions. [2025-04-29 11:23:02,553 INFO L79 Accepts]: Start accepts. Automaton has 328 states and 431 transitions. Word has length 41 [2025-04-29 11:23:02,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:02,553 INFO L485 AbstractCegarLoop]: Abstraction has 328 states and 431 transitions. [2025-04-29 11:23:02,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,553 INFO L278 IsEmpty]: Start isEmpty. Operand 328 states and 431 transitions. [2025-04-29 11:23:02,554 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:23:02,554 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:02,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:02,560 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:23:02,758 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,SelfDestructingSolverStorable23 [2025-04-29 11:23:02,758 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:02,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1312931135, now seen corresponding path program 1 times [2025-04-29 11:23:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:02,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489212768] [2025-04-29 11:23:02,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:02,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:23:02,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:23:02,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:02,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:03,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:03,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489212768] [2025-04-29 11:23:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489212768] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:03,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214892064] [2025-04-29 11:23:03,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:03,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:03,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:03,081 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:23:03,082 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:23:03,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:23:03,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:23:03,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:03,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:03,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-29 11:23:03,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:03,179 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:23:03,185 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:03,186 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:23:03,209 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:23:03,213 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:23:03,282 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:23:03,282 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:23:03,286 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:23:03,323 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:23:03,323 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:23:03,335 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:23:03,418 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:23:03,422 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:23:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:03,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:03,601 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_400) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_399) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (forall ((v_ArrVal_400 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_400) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2025-04-29 11:23:03,619 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_397 (Array Int Int)) (v_ArrVal_398 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_397) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_398) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_400) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_397 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_398))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_397) .cse0 v_ArrVal_400) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_399) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))) is different from false [2025-04-29 11:23:03,716 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:03,717 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 36 treesize of output 37 [2025-04-29 11:23:03,724 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:03,725 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 30 treesize of output 31 [2025-04-29 11:23:03,727 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 54 treesize of output 46 [2025-04-29 11:23:03,735 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:03,736 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 166 treesize of output 161 [2025-04-29 11:23:03,742 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 56 treesize of output 54 [2025-04-29 11:23:03,747 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 54 treesize of output 50 [2025-04-29 11:23:03,751 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 74 treesize of output 68 [2025-04-29 11:23:03,789 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:03,789 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 73 treesize of output 74 [2025-04-29 11:23:03,795 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:03,795 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 65 treesize of output 50 [2025-04-29 11:23:03,798 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:03,798 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:03,800 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 74 treesize of output 50 [2025-04-29 11:23:03,802 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:03,804 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 20 treesize of output 12 [2025-04-29 11:23:03,921 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:03,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2025-04-29 11:23:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:03,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214892064] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:03,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:03,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2025-04-29 11:23:03,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957004843] [2025-04-29 11:23:03,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:03,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:23:03,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:03,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:23:03,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=670, Unknown=23, NotChecked=110, Total=930 [2025-04-29 11:23:03,997 INFO L87 Difference]: Start difference. First operand 328 states and 431 transitions. Second operand has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:04,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:04,970 INFO L93 Difference]: Finished difference Result 481 states and 610 transitions. [2025-04-29 11:23:04,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:23:04,970 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 11:23:04,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:04,971 INFO L225 Difference]: With dead ends: 481 [2025-04-29 11:23:04,972 INFO L226 Difference]: Without dead ends: 481 [2025-04-29 11:23:04,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=1267, Unknown=27, NotChecked=154, Total=1722 [2025-04-29 11:23:04,972 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 563 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 637 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:04,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1176 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1325 Invalid, 0 Unknown, 637 Unchecked, 0.7s Time] [2025-04-29 11:23:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-04-29 11:23:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 343. [2025-04-29 11:23:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 321 states have (on average 1.4205607476635513) internal successors, (456), 342 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 456 transitions. [2025-04-29 11:23:04,982 INFO L79 Accepts]: Start accepts. Automaton has 343 states and 456 transitions. Word has length 41 [2025-04-29 11:23:04,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:04,982 INFO L485 AbstractCegarLoop]: Abstraction has 343 states and 456 transitions. [2025-04-29 11:23:04,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:04,983 INFO L278 IsEmpty]: Start isEmpty. Operand 343 states and 456 transitions. [2025-04-29 11:23:04,983 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:23:04,983 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:04,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:04,990 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:23:05,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:05,184 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:05,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:05,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1313115832, now seen corresponding path program 1 times [2025-04-29 11:23:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:05,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853651137] [2025-04-29 11:23:05,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:05,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:05,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:23:05,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:23:05,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:23:05,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:05,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853651137] [2025-04-29 11:23:05,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853651137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:05,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:05,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:23:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020946163] [2025-04-29 11:23:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:05,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:05,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:05,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:05,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:05,256 INFO L87 Difference]: Start difference. First operand 343 states and 456 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:05,365 INFO L93 Difference]: Finished difference Result 343 states and 450 transitions. [2025-04-29 11:23:05,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:05,365 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 11:23:05,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:05,366 INFO L225 Difference]: With dead ends: 343 [2025-04-29 11:23:05,366 INFO L226 Difference]: Without dead ends: 343 [2025-04-29 11:23:05,367 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:05,367 INFO L437 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:05,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 315 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-04-29 11:23:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 335. [2025-04-29 11:23:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 313 states have (on average 1.4121405750798721) internal successors, (442), 334 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 442 transitions. [2025-04-29 11:23:05,372 INFO L79 Accepts]: Start accepts. Automaton has 335 states and 442 transitions. Word has length 41 [2025-04-29 11:23:05,372 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:05,372 INFO L485 AbstractCegarLoop]: Abstraction has 335 states and 442 transitions. [2025-04-29 11:23:05,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:05,372 INFO L278 IsEmpty]: Start isEmpty. Operand 335 states and 442 transitions. [2025-04-29 11:23:05,372 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:23:05,372 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:05,372 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:05,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:23:05,373 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:05,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash 836462965, now seen corresponding path program 1 times [2025-04-29 11:23:05,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:05,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460021603] [2025-04-29 11:23:05,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:05,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:05,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:23:05,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:23:05,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:05,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:23:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:06,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460021603] [2025-04-29 11:23:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460021603] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:06,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832603195] [2025-04-29 11:23:06,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:06,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:06,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:06,024 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:23:06,025 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:23:06,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:23:06,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:23:06,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:06,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:06,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:23:06,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:06,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:06,349 INFO L325 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-04-29 11:23:06,349 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 30 treesize of output 25 [2025-04-29 11:23:06,359 INFO L325 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-04-29 11:23:06,360 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 24 treesize of output 12 [2025-04-29 11:23:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:06,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832603195] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:06,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:06,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 26 [2025-04-29 11:23:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744248636] [2025-04-29 11:23:06,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:06,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 11:23:06,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:06,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 11:23:06,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:23:06,402 INFO L87 Difference]: Start difference. First operand 335 states and 442 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 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:23:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:07,551 INFO L93 Difference]: Finished difference Result 593 states and 732 transitions. [2025-04-29 11:23:07,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-29 11:23:07,551 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 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 41 [2025-04-29 11:23:07,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:07,553 INFO L225 Difference]: With dead ends: 593 [2025-04-29 11:23:07,553 INFO L226 Difference]: Without dead ends: 593 [2025-04-29 11:23:07,553 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=720, Invalid=2360, Unknown=0, NotChecked=0, Total=3080 [2025-04-29 11:23:07,554 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 723 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:07,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 939 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:23:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-04-29 11:23:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 352. [2025-04-29 11:23:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 330 states have (on average 1.3727272727272728) internal successors, (453), 351 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 453 transitions. [2025-04-29 11:23:07,561 INFO L79 Accepts]: Start accepts. Automaton has 352 states and 453 transitions. Word has length 41 [2025-04-29 11:23:07,561 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:07,561 INFO L485 AbstractCegarLoop]: Abstraction has 352 states and 453 transitions. [2025-04-29 11:23:07,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 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:23:07,562 INFO L278 IsEmpty]: Start isEmpty. Operand 352 states and 453 transitions. [2025-04-29 11:23:07,562 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:23:07,562 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:07,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:07,568 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:23:07,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 11:23:07,766 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:07,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:07,766 INFO L85 PathProgramCache]: Analyzing trace with hash -334418882, now seen corresponding path program 1 times [2025-04-29 11:23:07,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:07,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223197908] [2025-04-29 11:23:07,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:07,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:07,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:23:07,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:23:07,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:07,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:08,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:08,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223197908] [2025-04-29 11:23:08,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223197908] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:08,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:08,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-29 11:23:08,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29837801] [2025-04-29 11:23:08,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:08,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:23:08,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:08,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:23:08,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:23:08,128 INFO L87 Difference]: Start difference. First operand 352 states and 453 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 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:23:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:08,719 INFO L93 Difference]: Finished difference Result 616 states and 773 transitions. [2025-04-29 11:23:08,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:23:08,719 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 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:23:08,719 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:08,720 INFO L225 Difference]: With dead ends: 616 [2025-04-29 11:23:08,720 INFO L226 Difference]: Without dead ends: 616 [2025-04-29 11:23:08,721 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:23:08,721 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 357 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:08,721 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 820 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:23:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-04-29 11:23:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 478. [2025-04-29 11:23:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 456 states have (on average 1.375) internal successors, (627), 477 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 627 transitions. [2025-04-29 11:23:08,727 INFO L79 Accepts]: Start accepts. Automaton has 478 states and 627 transitions. Word has length 41 [2025-04-29 11:23:08,727 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:08,728 INFO L485 AbstractCegarLoop]: Abstraction has 478 states and 627 transitions. [2025-04-29 11:23:08,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 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:23:08,728 INFO L278 IsEmpty]: Start isEmpty. Operand 478 states and 627 transitions. [2025-04-29 11:23:08,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:23:08,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:08,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:08,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:23:08,728 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:08,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash -810887051, now seen corresponding path program 1 times [2025-04-29 11:23:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:08,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220480314] [2025-04-29 11:23:08,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:08,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:23:08,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:23:08,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:08,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:09,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:09,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220480314] [2025-04-29 11:23:09,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220480314] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:09,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720492700] [2025-04-29 11:23:09,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:09,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:09,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:09,049 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:23:09,051 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:23:09,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:23:09,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:23:09,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:09,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:09,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:23:09,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:09,179 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:09,179 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:23:09,200 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 19 treesize of output 1 [2025-04-29 11:23:09,249 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:09,250 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 31 treesize of output 32 [2025-04-29 11:23:09,278 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:09,278 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 42 treesize of output 41 [2025-04-29 11:23:09,336 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 31 treesize of output 13 [2025-04-29 11:23:09,362 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:23:09,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:09,417 INFO L325 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-04-29 11:23:09,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:23:09,421 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem19#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)))) is different from false [2025-04-29 11:23:09,453 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_547))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select (store .cse0 .cse1 v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) .cse1)))) is different from false [2025-04-29 11:23:09,499 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:09,499 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 63 treesize of output 44 [2025-04-29 11:23:09,506 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:09,507 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 498 treesize of output 395 [2025-04-29 11:23:09,518 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:09,518 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 335 treesize of output 279 [2025-04-29 11:23:09,522 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 271 treesize of output 239 [2025-04-29 11:23:09,724 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:09,724 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2025-04-29 11:23:09,735 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:23:09,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720492700] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:09,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:09,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 30 [2025-04-29 11:23:09,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104191135] [2025-04-29 11:23:09,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:09,736 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-29 11:23:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:09,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-29 11:23:09,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=650, Unknown=15, NotChecked=106, Total=870 [2025-04-29 11:23:09,738 INFO L87 Difference]: Start difference. First operand 478 states and 627 transitions. Second operand has 30 states, 30 states have (on average 3.566666666666667) internal successors, (107), 30 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:11,004 INFO L93 Difference]: Finished difference Result 736 states and 903 transitions. [2025-04-29 11:23:11,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-29 11:23:11,004 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.566666666666667) internal successors, (107), 30 states have internal predecessors, (107), 0 states have call successors, (0), 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:23:11,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:11,006 INFO L225 Difference]: With dead ends: 736 [2025-04-29 11:23:11,006 INFO L226 Difference]: Without dead ends: 736 [2025-04-29 11:23:11,007 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=557, Invalid=2974, Unknown=17, NotChecked=234, Total=3782 [2025-04-29 11:23:11,007 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 990 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 935 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:11,007 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1444 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1804 Invalid, 0 Unknown, 935 Unchecked, 0.7s Time] [2025-04-29 11:23:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-04-29 11:23:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 492. [2025-04-29 11:23:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 470 states have (on average 1.372340425531915) internal successors, (645), 491 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 645 transitions. [2025-04-29 11:23:11,020 INFO L79 Accepts]: Start accepts. Automaton has 492 states and 645 transitions. Word has length 41 [2025-04-29 11:23:11,021 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:11,021 INFO L485 AbstractCegarLoop]: Abstraction has 492 states and 645 transitions. [2025-04-29 11:23:11,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.566666666666667) internal successors, (107), 30 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,021 INFO L278 IsEmpty]: Start isEmpty. Operand 492 states and 645 transitions. [2025-04-29 11:23:11,021 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:23:11,021 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:11,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:11,029 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:23:11,222 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,SelfDestructingSolverStorable28 [2025-04-29 11:23:11,222 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:11,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash -36686755, now seen corresponding path program 1 times [2025-04-29 11:23:11,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:11,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915321335] [2025-04-29 11:23:11,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:11,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:23:11,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:23:11,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:11,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:11,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915321335] [2025-04-29 11:23:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915321335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:11,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:11,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:23:11,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871830093] [2025-04-29 11:23:11,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:11,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:23:11,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:11,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:23:11,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:23:11,421 INFO L87 Difference]: Start difference. First operand 492 states and 645 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:11,775 INFO L93 Difference]: Finished difference Result 740 states and 936 transitions. [2025-04-29 11:23:11,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:23:11,776 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-29 11:23:11,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:11,778 INFO L225 Difference]: With dead ends: 740 [2025-04-29 11:23:11,778 INFO L226 Difference]: Without dead ends: 725 [2025-04-29 11:23:11,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:23:11,778 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 231 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:11,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 823 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-04-29 11:23:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 502. [2025-04-29 11:23:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 480 states have (on average 1.3666666666666667) internal successors, (656), 501 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 656 transitions. [2025-04-29 11:23:11,784 INFO L79 Accepts]: Start accepts. Automaton has 502 states and 656 transitions. Word has length 43 [2025-04-29 11:23:11,784 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:11,784 INFO L485 AbstractCegarLoop]: Abstraction has 502 states and 656 transitions. [2025-04-29 11:23:11,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:11,785 INFO L278 IsEmpty]: Start isEmpty. Operand 502 states and 656 transitions. [2025-04-29 11:23:11,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:23:11,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:11,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:11,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:23:11,785 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:11,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1257098061, now seen corresponding path program 1 times [2025-04-29 11:23:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:11,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037396555] [2025-04-29 11:23:11,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:11,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:23:11,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:23:11,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:11,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:12,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:12,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037396555] [2025-04-29 11:23:12,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037396555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:12,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079362083] [2025-04-29 11:23:12,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:12,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:12,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:12,036 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:23:12,038 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:23:12,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:23:12,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:23:12,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:12,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:12,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:23:12,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:12,168 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:12,168 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:23:12,184 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 19 treesize of output 1 [2025-04-29 11:23:12,220 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:12,220 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 31 treesize of output 32 [2025-04-29 11:23:12,245 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:12,245 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 42 treesize of output 41 [2025-04-29 11:23:12,303 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 31 treesize of output 13 [2025-04-29 11:23:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:12,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:12,351 INFO L325 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-04-29 11:23:12,351 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:23:12,395 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_625 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_624))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select (store .cse0 .cse1 v_ArrVal_625) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) .cse1)))) is different from false [2025-04-29 11:23:12,432 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:12,432 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 63 treesize of output 44 [2025-04-29 11:23:12,439 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:12,439 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 498 treesize of output 395 [2025-04-29 11:23:12,447 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 335 treesize of output 303 [2025-04-29 11:23:12,455 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:12,455 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 303 treesize of output 247 [2025-04-29 11:23:12,644 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:12,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2025-04-29 11:23:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:12,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079362083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:12,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:12,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 27 [2025-04-29 11:23:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140379683] [2025-04-29 11:23:12,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:12,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:23:12,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:12,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:23:12,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=581, Unknown=15, NotChecked=50, Total=756 [2025-04-29 11:23:12,656 INFO L87 Difference]: Start difference. First operand 502 states and 656 transitions. Second operand has 28 states, 27 states have (on average 4.333333333333333) internal successors, (117), 28 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:13,469 INFO L93 Difference]: Finished difference Result 716 states and 908 transitions. [2025-04-29 11:23:13,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:23:13,470 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.333333333333333) internal successors, (117), 28 states have internal predecessors, (117), 0 states have call successors, (0), 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:23:13,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:13,471 INFO L225 Difference]: With dead ends: 716 [2025-04-29 11:23:13,471 INFO L226 Difference]: Without dead ends: 716 [2025-04-29 11:23:13,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1075, Unknown=15, NotChecked=70, Total=1406 [2025-04-29 11:23:13,472 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 538 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:13,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1507 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1745 Invalid, 0 Unknown, 308 Unchecked, 0.7s Time] [2025-04-29 11:23:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-04-29 11:23:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 577. [2025-04-29 11:23:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 555 states have (on average 1.3513513513513513) internal successors, (750), 576 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 750 transitions. [2025-04-29 11:23:13,479 INFO L79 Accepts]: Start accepts. Automaton has 577 states and 750 transitions. Word has length 43 [2025-04-29 11:23:13,479 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:13,479 INFO L485 AbstractCegarLoop]: Abstraction has 577 states and 750 transitions. [2025-04-29 11:23:13,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.333333333333333) internal successors, (117), 28 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,479 INFO L278 IsEmpty]: Start isEmpty. Operand 577 states and 750 transitions. [2025-04-29 11:23:13,479 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:23:13,479 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:13,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:13,487 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:23:13,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:13,685 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:13,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1257098060, now seen corresponding path program 1 times [2025-04-29 11:23:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:13,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211084964] [2025-04-29 11:23:13,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:13,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:23:13,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:23:13,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:13,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:14,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211084964] [2025-04-29 11:23:14,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211084964] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:14,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052829891] [2025-04-29 11:23:14,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:14,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:14,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:14,261 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:23:14,262 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:23:14,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:23:14,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:23:14,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:14,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:14,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-29 11:23:14,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:14,439 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:14,439 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:23:14,446 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:23:14,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:23:14,479 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:23:14,545 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:23:14,545 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 53 treesize of output 48 [2025-04-29 11:23:14,550 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 27 treesize of output 22 [2025-04-29 11:23:14,643 INFO L325 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-04-29 11:23:14,644 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 40 treesize of output 35 [2025-04-29 11:23:14,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:14,657 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:23:14,658 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 1 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:23:15,208 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:15,208 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 51 treesize of output 31 [2025-04-29 11:23:15,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:15,214 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:15,215 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-04-29 11:23:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:15,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:15,638 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse5))) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse5)) (.cse1 (select |c_#memory_$Pointer$#0.offset| .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem18#1.offset_14| Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 (store .cse1 |v_ULTIMATE.start_main_#t~mem18#1.offset_14| 0)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 1)) (< .cse3 |v_ULTIMATE.start_main_#t~mem18#1.offset_14|))) (or (forall ((|v_ULTIMATE.start_main_#t~mem18#1.offset_14| Int)) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 (store .cse1 |v_ULTIMATE.start_main_#t~mem18#1.offset_14| 0)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 0) (< .cse3 |v_ULTIMATE.start_main_#t~mem18#1.offset_14|))) (forall ((v_ArrVal_680 (Array Int Int))) (< (+ 3 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_680) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_#t~mem18#1.offset_14| Int)) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem18#1.offset_14|) (forall ((v_ArrVal_680 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_680) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (or (= .cse4 0) (< (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 (store .cse1 |v_ULTIMATE.start_main_#t~mem18#1.offset_14| 0)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 3) (select |c_#length| .cse4))))))))))) is different from false [2025-04-29 11:23:15,671 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:15,671 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 42 treesize of output 43 [2025-04-29 11:23:15,675 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 129 treesize of output 117 [2025-04-29 11:23:15,685 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:15,685 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:23:15,690 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 74 treesize of output 66 [2025-04-29 11:23:15,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:15,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:15,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:15,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:15,773 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:15,773 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 94 treesize of output 74 [2025-04-29 11:23:15,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:15,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:15,779 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 97 [2025-04-29 11:23:15,788 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 70 treesize of output 58 [2025-04-29 11:23:15,884 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:15,885 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 71 treesize of output 76 [2025-04-29 11:23:15,994 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:15,994 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2025-04-29 11:23:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052829891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:16,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:16,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 40 [2025-04-29 11:23:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121953681] [2025-04-29 11:23:16,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:16,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 11:23:16,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:16,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 11:23:16,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1342, Unknown=4, NotChecked=76, Total=1640 [2025-04-29 11:23:16,076 INFO L87 Difference]: Start difference. First operand 577 states and 750 transitions. Second operand has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 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:23:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:20,035 INFO L93 Difference]: Finished difference Result 1143 states and 1406 transitions. [2025-04-29 11:23:20,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-29 11:23:20,035 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-29 11:23:20,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:20,037 INFO L225 Difference]: With dead ends: 1143 [2025-04-29 11:23:20,037 INFO L226 Difference]: Without dead ends: 1143 [2025-04-29 11:23:20,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2645 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1675, Invalid=7067, Unknown=4, NotChecked=184, Total=8930 [2025-04-29 11:23:20,039 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 1552 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 3654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 690 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:20,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 2424 Invalid, 3654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2812 Invalid, 0 Unknown, 690 Unchecked, 1.6s Time] [2025-04-29 11:23:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-04-29 11:23:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 798. [2025-04-29 11:23:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 776 states have (on average 1.365979381443299) internal successors, (1060), 797 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1060 transitions. [2025-04-29 11:23:20,050 INFO L79 Accepts]: Start accepts. Automaton has 798 states and 1060 transitions. Word has length 43 [2025-04-29 11:23:20,050 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:20,050 INFO L485 AbstractCegarLoop]: Abstraction has 798 states and 1060 transitions. [2025-04-29 11:23:20,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 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:23:20,050 INFO L278 IsEmpty]: Start isEmpty. Operand 798 states and 1060 transitions. [2025-04-29 11:23:20,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:23:20,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:20,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:20,057 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:23:20,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:20,254 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:20,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1702880093, now seen corresponding path program 1 times [2025-04-29 11:23:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:20,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18469271] [2025-04-29 11:23:20,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:20,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:23:20,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:23:20,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:20,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:20,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18469271] [2025-04-29 11:23:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18469271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:20,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:20,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:23:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898340905] [2025-04-29 11:23:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:20,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:23:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:20,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:23:20,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:23:20,461 INFO L87 Difference]: Start difference. First operand 798 states and 1060 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:20,832 INFO L93 Difference]: Finished difference Result 959 states and 1254 transitions. [2025-04-29 11:23:20,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:23:20,832 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-29 11:23:20,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:20,834 INFO L225 Difference]: With dead ends: 959 [2025-04-29 11:23:20,834 INFO L226 Difference]: Without dead ends: 959 [2025-04-29 11:23:20,834 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:23:20,835 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 382 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:20,835 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 752 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:23:20,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-04-29 11:23:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 798. [2025-04-29 11:23:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 776 states have (on average 1.3634020618556701) internal successors, (1058), 797 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1058 transitions. [2025-04-29 11:23:20,843 INFO L79 Accepts]: Start accepts. Automaton has 798 states and 1058 transitions. Word has length 43 [2025-04-29 11:23:20,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:20,843 INFO L485 AbstractCegarLoop]: Abstraction has 798 states and 1058 transitions. [2025-04-29 11:23:20,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:20,843 INFO L278 IsEmpty]: Start isEmpty. Operand 798 states and 1058 transitions. [2025-04-29 11:23:20,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:23:20,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:20,844 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] [2025-04-29 11:23:20,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-29 11:23:20,844 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:20,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash -418719781, now seen corresponding path program 1 times [2025-04-29 11:23:20,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:20,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283970955] [2025-04-29 11:23:20,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:20,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:20,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:23:20,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:23:20,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:20,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:23:20,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:20,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283970955] [2025-04-29 11:23:20,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283970955] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:20,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174365218] [2025-04-29 11:23:20,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:20,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:20,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:20,881 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:23:20,883 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:23:20,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:23:20,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:23:20,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:20,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:20,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:23:20,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:20,997 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:23:20,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:21,029 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:23:21,030 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 12 treesize of output 11 [2025-04-29 11:23:21,038 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:23:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174365218] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:21,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:21,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 6 [2025-04-29 11:23:21,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61865147] [2025-04-29 11:23:21,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:21,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:23:21,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:21,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:23:21,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:21,039 INFO L87 Difference]: Start difference. First operand 798 states and 1058 transitions. Second operand has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 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:23:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:21,182 INFO L93 Difference]: Finished difference Result 858 states and 1100 transitions. [2025-04-29 11:23:21,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:23:21,183 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 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 48 [2025-04-29 11:23:21,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:21,184 INFO L225 Difference]: With dead ends: 858 [2025-04-29 11:23:21,184 INFO L226 Difference]: Without dead ends: 858 [2025-04-29 11:23:21,184 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:23:21,185 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 280 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:21,185 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 146 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-04-29 11:23:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 795. [2025-04-29 11:23:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 776 states have (on average 1.3286082474226804) internal successors, (1031), 794 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1031 transitions. [2025-04-29 11:23:21,192 INFO L79 Accepts]: Start accepts. Automaton has 795 states and 1031 transitions. Word has length 48 [2025-04-29 11:23:21,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:21,192 INFO L485 AbstractCegarLoop]: Abstraction has 795 states and 1031 transitions. [2025-04-29 11:23:21,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 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:23:21,192 INFO L278 IsEmpty]: Start isEmpty. Operand 795 states and 1031 transitions. [2025-04-29 11:23:21,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:23:21,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:21,193 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] [2025-04-29 11:23:21,201 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:23:21,393 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,SelfDestructingSolverStorable33 [2025-04-29 11:23:21,393 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:21,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:21,393 INFO L85 PathProgramCache]: Analyzing trace with hash -418719780, now seen corresponding path program 1 times [2025-04-29 11:23:21,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:21,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505278811] [2025-04-29 11:23:21,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:21,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:21,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:23:21,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:23:21,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:21,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:23:21,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:21,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505278811] [2025-04-29 11:23:21,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505278811] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:21,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304836704] [2025-04-29 11:23:21,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:21,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:21,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:21,467 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:23:21,468 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:23:21,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:23:21,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:23:21,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:21,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:21,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:23:21,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:21,555 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:23:21,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:21,615 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:23:21,621 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:21,621 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:23:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:23:21,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:21,854 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:23:21,855 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 13 treesize of output 12 [2025-04-29 11:23:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:23:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304836704] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:21,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-04-29 11:23:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039646958] [2025-04-29 11:23:21,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:21,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:23:21,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:21,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:23:21,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:23:21,900 INFO L87 Difference]: Start difference. First operand 795 states and 1031 transitions. Second operand has 19 states, 18 states have (on average 7.722222222222222) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:22,224 INFO L93 Difference]: Finished difference Result 931 states and 1176 transitions. [2025-04-29 11:23:22,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:23:22,224 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 7.722222222222222) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-04-29 11:23:22,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:22,226 INFO L225 Difference]: With dead ends: 931 [2025-04-29 11:23:22,226 INFO L226 Difference]: Without dead ends: 931 [2025-04-29 11:23:22,227 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=906, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 11:23:22,227 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 1110 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:22,227 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 308 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-04-29 11:23:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 857. [2025-04-29 11:23:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 840 states have (on average 1.3107142857142857) internal successors, (1101), 856 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1101 transitions. [2025-04-29 11:23:22,233 INFO L79 Accepts]: Start accepts. Automaton has 857 states and 1101 transitions. Word has length 48 [2025-04-29 11:23:22,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:22,233 INFO L485 AbstractCegarLoop]: Abstraction has 857 states and 1101 transitions. [2025-04-29 11:23:22,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 7.722222222222222) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:22,234 INFO L278 IsEmpty]: Start isEmpty. Operand 857 states and 1101 transitions. [2025-04-29 11:23:22,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:23:22,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:22,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:22,240 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:23:22,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-29 11:23:22,438 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-04-29 11:23:22,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:22,438 INFO L85 PathProgramCache]: Analyzing trace with hash 277200180, now seen corresponding path program 1 times [2025-04-29 11:23:22,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:22,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99423024] [2025-04-29 11:23:22,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:22,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:22,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:23:22,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:23:22,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:22,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:22,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99423024] [2025-04-29 11:23:22,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99423024] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:22,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178748424] [2025-04-29 11:23:22,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:22,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:22,800 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:23:22,802 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:23:22,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:23:22,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:23:22,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:22,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:22,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-29 11:23:22,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:22,973 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:23:22,973 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 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:23:23,010 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 15 treesize of output 1 [2025-04-29 11:23:23,014 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:23:23,095 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 11:23:23,095 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 64 treesize of output 42 [2025-04-29 11:23:23,097 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 22 [2025-04-29 11:23:23,194 INFO L325 Elim1Store]: treesize reduction 22, result has 31.3 percent of original size [2025-04-29 11:23:23,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 63 [2025-04-29 11:23:23,200 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 35 treesize of output 16 [2025-04-29 11:23:23,264 INFO L325 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-04-29 11:23:23,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-04-29 11:23:23,308 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:23:23,313 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 53 treesize of output 29 [2025-04-29 11:23:23,419 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:23:23,419 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 87 treesize of output 72 [2025-04-29 11:23:23,422 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 24 treesize of output 11 [2025-04-29 11:23:23,532 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:23:23,532 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 87 treesize of output 72 [2025-04-29 11:23:23,537 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 24 treesize of output 11 [2025-04-29 11:23:23,793 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 62 treesize of output 30 [2025-04-29 11:23:23,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-04-29 11:23:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:23,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:23,952 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_899 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (or (forall ((v_ArrVal_899 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2025-04-29 11:23:29,762 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:29,932 INFO L325 Elim1Store]: treesize reduction 69, result has 53.7 percent of original size [2025-04-29 11:23:29,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 762639 treesize of output 691052 [2025-04-29 11:23:30,600 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:30,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6078 treesize of output 6030 [2025-04-29 11:23:30,668 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 6523 treesize of output 6363 [2025-04-29 11:23:30,813 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 6139 treesize of output 6123 [2025-04-29 11:23:30,883 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 6123 treesize of output 6011 [2025-04-29 11:23:30,971 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 6 treesize of output 4 [2025-04-29 11:23:31,043 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:31,043 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 49 treesize of output 51 [2025-04-29 11:23:31,123 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 6 treesize of output 4 [2025-04-29 11:23:40,177 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 6 treesize of output 4 [2025-04-29 11:23:41,611 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:41,612 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 1933 treesize of output 1907 [2025-04-29 11:23:44,257 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:44,258 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2669 treesize of output 2643 Killed by 15