./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/tree-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/tree-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ab0e6b3adccdafccbf4f7749fddf566a909e7e6b26ed4ad49012db1c4c97a10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:27:24,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:27:24,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:27:24,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:27:24,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:27:24,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:27:24,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:27:24,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:27:24,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:27:24,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:27:24,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:27:24,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:27:24,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:27:24,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:27:24,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:27:24,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:27:24,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:27:24,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:27:24,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:27:24,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:27:24,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:27:24,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:27:24,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:27:24,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:27:24,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:27:24,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:27:24,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:27:24,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:27:24,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:27:24,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:27:24,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:27:24,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:27:24,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:27:24,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:27:24,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:27:24,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:27:24,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:27:24,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:27:24,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:27:24,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:27:24,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:27:24,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:27:24,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:27:24,375 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 ! call(reach_error())) ) 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 -> 3ab0e6b3adccdafccbf4f7749fddf566a909e7e6b26ed4ad49012db1c4c97a10 [2025-03-08 04:27:24,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:27:24,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:27:24,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:27:24,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:27:24,573 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:27:24,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-3.i [2025-03-08 04:27:25,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980652048/0653e22ed1d843359537bd864f1b8587/FLAG626fe61f8 [2025-03-08 04:27:25,930 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:27:25,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-3.i [2025-03-08 04:27:25,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980652048/0653e22ed1d843359537bd864f1b8587/FLAG626fe61f8 [2025-03-08 04:27:26,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980652048/0653e22ed1d843359537bd864f1b8587 [2025-03-08 04:27:26,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:27:26,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:27:26,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:27:26,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:27:26,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:27:26,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a144549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26, skipping insertion in model container [2025-03-08 04:27:26,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:27:26,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-3.i[22626,22639] [2025-03-08 04:27:26,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:27:26,478 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:27:26,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-3.i[22626,22639] [2025-03-08 04:27:26,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:27:26,536 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:27:26,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26 WrapperNode [2025-03-08 04:27:26,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:27:26,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:27:26,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:27:26,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:27:26,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,565 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-03-08 04:27:26,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:27:26,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:27:26,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:27:26,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:27:26,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,588 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-03-08 04:27:26,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:27:26,598 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:27:26,598 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:27:26,598 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:27:26,599 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (1/1) ... [2025-03-08 04:27:26,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:27:26,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:26,619 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-03-08 04:27:26,621 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-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-08 04:27:26,636 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:27:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:27:26,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:27:26,717 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:27:26,719 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:27:26,949 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-08 04:27:26,949 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:27:26,955 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:27:26,955 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:27:26,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:27:26 BoogieIcfgContainer [2025-03-08 04:27:26,957 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:27:26,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:27:26,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:27:26,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:27:26,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:27:26" (1/3) ... [2025-03-08 04:27:26,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9046a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:27:26, skipping insertion in model container [2025-03-08 04:27:26,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:26" (2/3) ... [2025-03-08 04:27:26,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9046a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:27:26, skipping insertion in model container [2025-03-08 04:27:26,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:27:26" (3/3) ... [2025-03-08 04:27:26,964 INFO L128 eAbstractionObserver]: Analyzing ICFG tree-3.i [2025-03-08 04:27:26,974 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:27:26,976 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree-3.i that has 2 procedures, 46 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-03-08 04:27:27,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:27:27,019 INFO L333 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=LoopHeads, 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;@62b2916e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:27:27,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:27:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 40 states have (on average 1.65) internal successors, (66), 44 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 04:27:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 04:27:27,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:27,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:27,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:27,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:27,031 INFO L85 PathProgramCache]: Analyzing trace with hash -346677258, now seen corresponding path program 1 times [2025-03-08 04:27:27,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:27,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756006041] [2025-03-08 04:27:27,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:27,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:27,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:27:27,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:27:27,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:27,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:27,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:27,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756006041] [2025-03-08 04:27:27,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756006041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:27,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:27,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:27:27,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650982906] [2025-03-08 04:27:27,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:27,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:27:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:27,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:27:27,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:27:27,146 INFO L87 Difference]: Start difference. First operand has 46 states, 40 states have (on average 1.65) internal successors, (66), 44 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:27,162 INFO L93 Difference]: Finished difference Result 88 states and 141 transitions. [2025-03-08 04:27:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:27:27,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 04:27:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:27,167 INFO L225 Difference]: With dead ends: 88 [2025-03-08 04:27:27,167 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 04:27:27,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:27:27,174 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:27,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:27:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 04:27:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 04:27:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-08 04:27:27,195 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 10 [2025-03-08 04:27:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:27,195 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-08 04:27:27,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-08 04:27:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:27:27,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:27,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:27,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:27:27,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:27,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:27,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1032998434, now seen corresponding path program 1 times [2025-03-08 04:27:27,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:27,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023235656] [2025-03-08 04:27:27,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:27,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:27:27,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:27:27,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:27,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:27,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:27,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023235656] [2025-03-08 04:27:27,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023235656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:27,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:27,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:27:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663103230] [2025-03-08 04:27:27,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:27,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:27:27,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:27,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:27:27,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:27:27,277 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:27,333 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2025-03-08 04:27:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:27:27,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 04:27:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:27,334 INFO L225 Difference]: With dead ends: 57 [2025-03-08 04:27:27,334 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 04:27:27,335 INFO L434 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-03-08 04:27:27,335 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:27,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:27:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 04:27:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 04:27:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.3125) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2025-03-08 04:27:27,340 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 11 [2025-03-08 04:27:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:27,340 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-03-08 04:27:27,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2025-03-08 04:27:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:27:27,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:27,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:27,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:27:27,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:27,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1920502115, now seen corresponding path program 1 times [2025-03-08 04:27:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:27,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558378463] [2025-03-08 04:27:27,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:27,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:27,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:27:27,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:27:27,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:27,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558378463] [2025-03-08 04:27:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558378463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:27,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:27:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372436373] [2025-03-08 04:27:27,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:27,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:27:27,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:27,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:27:27,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:27:27,460 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:27,499 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2025-03-08 04:27:27,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:27:27,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 04:27:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:27,501 INFO L225 Difference]: With dead ends: 73 [2025-03-08 04:27:27,501 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 04:27:27,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:27:27,502 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:27,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 138 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:27:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 04:27:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 04:27:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 04:27:27,507 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 11 [2025-03-08 04:27:27,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:27,509 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 04:27:27,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 04:27:27,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 04:27:27,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:27,510 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:27,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:27:27,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:27,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1207309368, now seen corresponding path program 1 times [2025-03-08 04:27:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:27,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924640121] [2025-03-08 04:27:27,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:27,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 04:27:27,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:27:27,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:27,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:27,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:27,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924640121] [2025-03-08 04:27:27,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924640121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:27,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:27,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:27:27,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842360696] [2025-03-08 04:27:27,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:27,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:27:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:27,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:27:27,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:27:27,594 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:27,640 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-03-08 04:27:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:27:27,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 04:27:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:27,641 INFO L225 Difference]: With dead ends: 59 [2025-03-08 04:27:27,641 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 04:27:27,641 INFO L434 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-03-08 04:27:27,642 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:27,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:27:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 04:27:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-08 04:27:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-03-08 04:27:27,645 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2025-03-08 04:27:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:27,645 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-03-08 04:27:27,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-03-08 04:27:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:27:27,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:27,645 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:27,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:27:27,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:27,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash 101201851, now seen corresponding path program 1 times [2025-03-08 04:27:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:27,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125196651] [2025-03-08 04:27:27,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:27,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:27:27,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:27:27,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:27,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:27:27,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:27,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125196651] [2025-03-08 04:27:27,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125196651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:27,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:27,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 04:27:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727211432] [2025-03-08 04:27:27,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:27,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:27:27,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:27,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:27:27,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:27:27,774 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:27,923 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2025-03-08 04:27:27,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:27:27,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 04:27:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:27,925 INFO L225 Difference]: With dead ends: 81 [2025-03-08 04:27:27,925 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 04:27:27,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:27:27,925 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:27,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 112 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:27:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 04:27:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2025-03-08 04:27:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-08 04:27:27,930 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 22 [2025-03-08 04:27:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:27,932 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-08 04:27:27,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-08 04:27:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:27:27,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:27,933 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] [2025-03-08 04:27:27,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 04:27:27,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:27,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:27,935 INFO L85 PathProgramCache]: Analyzing trace with hash -926111703, now seen corresponding path program 1 times [2025-03-08 04:27:27,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:27,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623291400] [2025-03-08 04:27:27,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:27,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:27,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:27:27,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:27:27,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:27,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623291400] [2025-03-08 04:27:29,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623291400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:29,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939865040] [2025-03-08 04:27:29,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:29,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:29,197 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-03-08 04:27:29,199 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-03-08 04:27:29,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:27:29,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:27:29,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:29,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:29,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 04:27:29,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:29,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:27:29,435 INFO L378 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-03-08 04:27:29,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:29,542 INFO L349 Elim1Store]: treesize reduction 391, result has 0.3 percent of original size [2025-03-08 04:27:29,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 6695 treesize of output 4556 [2025-03-08 04:27:29,582 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:29,583 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:29,584 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:29,588 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:27:29,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:29,624 INFO L349 Elim1Store]: treesize reduction 391, result has 0.3 percent of original size [2025-03-08 04:27:29,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 6635 treesize of output 4508 [2025-03-08 04:27:29,690 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:29,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:29,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:30,760 INFO L349 Elim1Store]: treesize reduction 116, result has 30.1 percent of original size [2025-03-08 04:27:30,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 6108 treesize of output 3920 [2025-03-08 04:27:30,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:30,995 INFO L349 Elim1Store]: treesize reduction 48, result has 25.0 percent of original size [2025-03-08 04:27:30,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 1640 treesize of output 1477 [2025-03-08 04:27:31,059 INFO L349 Elim1Store]: treesize reduction 121, result has 5.5 percent of original size [2025-03-08 04:27:31,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 179 [2025-03-08 04:27:31,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:31,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:31,216 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:31,219 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:31,219 INFO L378 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 77 treesize of output 17 [2025-03-08 04:27:31,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 04:27:31,330 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2025-03-08 04:27:31,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:31,425 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:31,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 23 [2025-03-08 04:27:31,601 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:31,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:31,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:31,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-08 04:27:31,684 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2025-03-08 04:27:31,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-08 04:27:31,738 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 173 [2025-03-08 04:27:31,762 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 163 [2025-03-08 04:27:32,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:32,760 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-03-08 04:27:32,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 580 treesize of output 509 [2025-03-08 04:27:32,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:32,769 INFO L378 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 260 treesize of output 228 [2025-03-08 04:27:32,794 INFO L349 Elim1Store]: treesize reduction 29, result has 32.6 percent of original size [2025-03-08 04:27:32,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 157 [2025-03-08 04:27:32,802 INFO L378 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 161 treesize of output 141 [2025-03-08 04:27:32,807 INFO L378 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 124 treesize of output 122 [2025-03-08 04:27:32,812 INFO L378 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 122 treesize of output 120 [2025-03-08 04:27:32,817 INFO L378 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 120 treesize of output 118 [2025-03-08 04:27:32,822 INFO L378 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 118 treesize of output 116 [2025-03-08 04:27:32,828 INFO L378 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 116 treesize of output 114 [2025-03-08 04:27:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:32,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:32,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:32,981 INFO L378 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 2850 treesize of output 2336 [2025-03-08 04:27:33,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:33,020 INFO L378 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 4143 treesize of output 5055 [2025-03-08 04:27:33,070 INFO L378 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 134 treesize of output 4 [2025-03-08 04:27:33,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:33,304 INFO L378 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 1822 treesize of output 1823 [2025-03-08 04:27:33,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:33,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 11644 treesize of output 17204