./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/tree-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/tree-4.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:33:31,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:33:31,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:33:31,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:33:31,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:33:31,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:33:31,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:33:31,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:33:31,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:33:31,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:33:31,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:33:31,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:33:31,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:33:31,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:33:31,469 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:33:31,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:33:31,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:33:31,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:33:31,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:33:31,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:33:31,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:33:31,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:33:31,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:33:31,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:33:31,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:33:31,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:33:31,471 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:33:31,471 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:33:31,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:33:31,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:33:31,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:33:31,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:33:31,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:33:31,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:33:31,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:33:31,472 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:33:31,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:33:31,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:33:31,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:33:31,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:33:31,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:33:31,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:33:31,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:33:31,473 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-jdk21/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 -> 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e [2025-02-05 14:33:31,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:33:31,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:33:31,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:33:31,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:33:31,757 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:33:31,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-4.i [2025-02-05 14:33:33,062 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66fbf551f/ee8bd0dec93b460db67ddfd96e221090/FLAGe4152abfb [2025-02-05 14:33:33,343 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:33:33,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i [2025-02-05 14:33:33,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66fbf551f/ee8bd0dec93b460db67ddfd96e221090/FLAGe4152abfb [2025-02-05 14:33:33,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66fbf551f/ee8bd0dec93b460db67ddfd96e221090 [2025-02-05 14:33:33,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:33:33,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:33:33,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:33:33,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:33:33,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:33:33,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:33,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf7dd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33, skipping insertion in model container [2025-02-05 14:33:33,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:33,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:33:33,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2025-02-05 14:33:33,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:33:33,888 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:33:33,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2025-02-05 14:33:33,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:33:33,966 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:33:33,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33 WrapperNode [2025-02-05 14:33:33,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:33:33,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:33:33,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:33:33,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:33:33,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:33,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:33,999 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2025-02-05 14:33:33,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:33:34,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:33:34,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:33:34,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:33:34,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:34,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:34,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:34,029 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-02-05 14:33:34,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:34,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:34,036 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:34,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:34,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:34,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:34,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:33:34,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:33:34,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:33:34,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:33:34,043 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (1/1) ... [2025-02-05 14:33:34,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:33:34,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:33:34,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:33:34,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:33:34,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:33:34,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:33:34,093 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-05 14:33:34,093 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-05 14:33:34,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:33:34,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:33:34,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:33:34,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:33:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:33:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:33:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:33:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:33:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:33:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:33:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:33:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:33:34,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:33:34,194 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:33:34,196 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:33:34,486 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-05 14:33:34,487 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:33:34,496 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:33:34,497 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:33:34,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:33:34 BoogieIcfgContainer [2025-02-05 14:33:34,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:33:34,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:33:34,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:33:34,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:33:34,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:33:33" (1/3) ... [2025-02-05 14:33:34,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edddb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:33:34, skipping insertion in model container [2025-02-05 14:33:34,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:33:33" (2/3) ... [2025-02-05 14:33:34,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edddb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:33:34, skipping insertion in model container [2025-02-05 14:33:34,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:33:34" (3/3) ... [2025-02-05 14:33:34,508 INFO L128 eAbstractionObserver]: Analyzing ICFG tree-4.i [2025-02-05 14:33:34,524 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:33:34,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree-4.i that has 2 procedures, 45 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-02-05 14:33:34,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:33:34,585 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;@b7b2db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:33:34,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:33:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.641025641025641) internal successors, (64), 43 states have internal predecessors, (64), 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-02-05 14:33:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 14:33:34,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:33:34,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:33:34,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:33:34,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:33:34,601 INFO L85 PathProgramCache]: Analyzing trace with hash -485265103, now seen corresponding path program 1 times [2025-02-05 14:33:34,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:33:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293504799] [2025-02-05 14:33:34,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:33:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:33:34,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 14:33:34,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 14:33:34,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:33:34,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:33:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:33:34,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:33:34,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293504799] [2025-02-05 14:33:34,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293504799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:33:34,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:33:34,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:33:34,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111157968] [2025-02-05 14:33:34,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:33:34,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:33:34,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:33:34,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:33:34,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:33:34,774 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.641025641025641) internal successors, (64), 43 states have internal predecessors, (64), 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 5.0) internal successors, (10), 2 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-02-05 14:33:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:33:34,794 INFO L93 Difference]: Finished difference Result 86 states and 137 transitions. [2025-02-05 14:33:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:33:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-02-05 14:33:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:33:34,800 INFO L225 Difference]: With dead ends: 86 [2025-02-05 14:33:34,801 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 14:33:34,805 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-02-05 14:33:34,808 INFO L435 NwaCegarLoop]: 55 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, 55 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-02-05 14:33:34,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:33:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 14:33:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-05 14:33:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 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-02-05 14:33:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-02-05 14:33:34,841 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 11 [2025-02-05 14:33:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:33:34,842 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-02-05 14:33:34,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-02-05 14:33:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-02-05 14:33:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:33:34,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:33:34,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:33:34,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:33:34,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:33:34,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:33:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash -923157049, now seen corresponding path program 1 times [2025-02-05 14:33:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:33:34,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810994089] [2025-02-05 14:33:34,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:33:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:33:34,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:33:34,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:33:34,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:33:34,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:33:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:33:34,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:33:34,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810994089] [2025-02-05 14:33:34,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810994089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:33:34,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:33:34,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:33:34,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126433692] [2025-02-05 14:33:34,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:33:34,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:33:34,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:33:34,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:33:34,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:33:34,962 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-02-05 14:33:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:33:35,036 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-02-05 14:33:35,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:33:35,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-02-05 14:33:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:33:35,038 INFO L225 Difference]: With dead ends: 57 [2025-02-05 14:33:35,038 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:33:35,038 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-02-05 14:33:35,039 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 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-02-05 14:33:35,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:33:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:33:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-05 14:33:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 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-02-05 14:33:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-02-05 14:33:35,044 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 12 [2025-02-05 14:33:35,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:33:35,045 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-02-05 14:33:35,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-02-05 14:33:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-02-05 14:33:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:33:35,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:33:35,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:33:35,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:33:35,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:33:35,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:33:35,046 INFO L85 PathProgramCache]: Analyzing trace with hash 819653286, now seen corresponding path program 1 times [2025-02-05 14:33:35,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:33:35,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46731824] [2025-02-05 14:33:35,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:33:35,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:33:35,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:33:35,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:33:35,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:33:35,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:33:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:33:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:33:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46731824] [2025-02-05 14:33:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46731824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:33:35,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:33:35,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:33:35,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225326699] [2025-02-05 14:33:35,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:33:35,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:33:35,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:33:35,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:33:35,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:33:35,223 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-02-05 14:33:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:33:35,265 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2025-02-05 14:33:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:33:35,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 12 [2025-02-05 14:33:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:33:35,268 INFO L225 Difference]: With dead ends: 71 [2025-02-05 14:33:35,268 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 14:33:35,268 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-02-05 14:33:35,269 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 130 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-02-05 14:33:35,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 130 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:33:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 14:33:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-05 14:33:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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-02-05 14:33:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-02-05 14:33:35,277 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 12 [2025-02-05 14:33:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:33:35,277 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-02-05 14:33:35,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-02-05 14:33:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-02-05 14:33:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 14:33:35,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:33:35,278 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:33:35,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:33:35,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:33:35,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:33:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash 684030466, now seen corresponding path program 1 times [2025-02-05 14:33:35,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:33:35,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816148351] [2025-02-05 14:33:35,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:33:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:33:35,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 14:33:35,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 14:33:35,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:33:35,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:33:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:33:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:33:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816148351] [2025-02-05 14:33:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816148351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:33:35,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:33:35,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:33:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087282491] [2025-02-05 14:33:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:33:35,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:33:35,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:33:35,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:33:35,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:33:35,374 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-02-05 14:33:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:33:35,435 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-02-05 14:33:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:33:35,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18 [2025-02-05 14:33:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:33:35,436 INFO L225 Difference]: With dead ends: 59 [2025-02-05 14:33:35,437 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 14:33:35,438 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-02-05 14:33:35,438 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:33:35,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:33:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 14:33:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-02-05 14:33:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 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-02-05 14:33:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-02-05 14:33:35,447 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 18 [2025-02-05 14:33:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:33:35,447 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-02-05 14:33:35,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-02-05 14:33:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-02-05 14:33:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 14:33:35,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:33:35,448 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] [2025-02-05 14:33:35,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:33:35,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:33:35,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:33:35,450 INFO L85 PathProgramCache]: Analyzing trace with hash -595491218, now seen corresponding path program 1 times [2025-02-05 14:33:35,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:33:35,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813210729] [2025-02-05 14:33:35,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:33:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:33:35,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 14:33:35,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 14:33:35,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:33:35,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:33:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:33:35,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:33:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813210729] [2025-02-05 14:33:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813210729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:33:35,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:33:35,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:33:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750246140] [2025-02-05 14:33:35,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:33:35,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:33:35,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:33:35,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:33:35,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:33:35,690 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-02-05 14:33:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:33:35,868 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2025-02-05 14:33:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 14:33:35,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 21 [2025-02-05 14:33:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:33:35,871 INFO L225 Difference]: With dead ends: 79 [2025-02-05 14:33:35,871 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 14:33:35,871 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-02-05 14:33:35,872 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 101 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-02-05 14:33:35,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 101 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:33:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 14:33:35,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2025-02-05 14:33:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 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-02-05 14:33:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-02-05 14:33:35,877 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 21 [2025-02-05 14:33:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:33:35,877 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-02-05 14:33:35,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-02-05 14:33:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-02-05 14:33:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:33:35,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:33:35,878 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:33:35,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 14:33:35,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:33:35,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:33:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash -885782630, now seen corresponding path program 1 times [2025-02-05 14:33:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:33:35,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119124518] [2025-02-05 14:33:35,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:33:35,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:33:35,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:33:35,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:33:35,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:33:35,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:33:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:33:37,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:33:37,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119124518] [2025-02-05 14:33:37,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119124518] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:33:37,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7247407] [2025-02-05 14:33:37,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:33:37,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:33:37,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:33:37,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:33:37,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:33:37,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:33:37,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:33:37,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:33:37,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:33:37,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-05 14:33:37,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:33:37,811 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-02-05 14:33:37,828 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-02-05 14:33:37,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:37,985 INFO L349 Elim1Store]: treesize reduction 391, result has 0.3 percent of original size [2025-02-05 14:33:37,986 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-02-05 14:33:38,040 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:38,042 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:38,043 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:38,047 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:33:38,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:38,100 INFO L349 Elim1Store]: treesize reduction 391, result has 0.3 percent of original size [2025-02-05 14:33:38,101 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-02-05 14:33:38,188 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:38,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:38,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:39,671 INFO L349 Elim1Store]: treesize reduction 116, result has 30.1 percent of original size [2025-02-05 14:33:39,671 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-02-05 14:33:39,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:40,039 INFO L349 Elim1Store]: treesize reduction 48, result has 25.0 percent of original size [2025-02-05 14:33:40,040 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-02-05 14:33:40,110 INFO L349 Elim1Store]: treesize reduction 121, result has 5.5 percent of original size [2025-02-05 14:33:40,111 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-02-05 14:33:40,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:40,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:40,301 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:40,305 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:40,306 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-02-05 14:33:40,314 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-02-05 14:33:40,501 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-02-05 14:33:40,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:40,640 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:40,643 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-02-05 14:33:40,883 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:40,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:40,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:40,887 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-02-05 14:33:40,998 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-02-05 14:33:41,045 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-02-05 14:33:41,076 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-02-05 14:33:41,110 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-02-05 14:33:42,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:42,623 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-02-05 14:33:42,623 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-02-05 14:33:42,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:42,635 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-02-05 14:33:42,668 INFO L349 Elim1Store]: treesize reduction 29, result has 32.6 percent of original size [2025-02-05 14:33:42,668 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-02-05 14:33:42,679 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-02-05 14:33:42,685 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-02-05 14:33:42,692 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-02-05 14:33:42,698 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-02-05 14:33:42,704 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-02-05 14:33:42,710 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-02-05 14:33:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:33:42,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:33:42,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:33:42,901 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-02-05 14:33:42,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:33:42,952 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-02-05 14:33:43,022 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-02-05 14:33:43,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:33:43,336 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-02-05 14:33:44,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:33:44,016 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