./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/diamond_2-2.c --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/loop-acceleration/diamond_2-2.c -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 5b285e679a61ee5ec3c0d899a4a7682d4249c0885f5b4a5875891b312f202de4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:39:50,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:39:50,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:39:50,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:39:50,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:39:50,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:39:50,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:39:50,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:39:50,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:39:50,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:39:50,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:39:50,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:39:50,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:39:50,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:39:50,841 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:39:50,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:39:50,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:39:50,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:39:50,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:39:50,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:39:50,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:39:50,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:39:50,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:39:50,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:39:50,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:39:50,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:39:50,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:39:50,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:39:50,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:39:50,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:39:50,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:39:50,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:39:50,844 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 -> 5b285e679a61ee5ec3c0d899a4a7682d4249c0885f5b4a5875891b312f202de4 [2025-03-08 04:39:51,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:39:51,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:39:51,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:39:51,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:39:51,069 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:39:51,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/diamond_2-2.c [2025-03-08 04:39:52,233 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806e862e1/8dc0b8c5cbf94e4e8024e05fb4ec7d4d/FLAGc76d6c234 [2025-03-08 04:39:52,453 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:39:52,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/diamond_2-2.c [2025-03-08 04:39:52,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806e862e1/8dc0b8c5cbf94e4e8024e05fb4ec7d4d/FLAGc76d6c234 [2025-03-08 04:39:52,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806e862e1/8dc0b8c5cbf94e4e8024e05fb4ec7d4d [2025-03-08 04:39:52,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:39:52,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:39:52,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:39:52,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:39:52,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:39:52,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:52,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c5208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52, skipping insertion in model container [2025-03-08 04:39:52,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:52,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:39:52,908 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/loop-acceleration/diamond_2-2.c[373,386] [2025-03-08 04:39:52,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:39:52,933 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:39:52,941 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/loop-acceleration/diamond_2-2.c[373,386] [2025-03-08 04:39:52,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:39:52,961 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:39:52,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52 WrapperNode [2025-03-08 04:39:52,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:39:52,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:39:52,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:39:52,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:39:52,968 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:39:52" (1/1) ... [2025-03-08 04:39:52,975 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:39:52" (1/1) ... [2025-03-08 04:39:52,986 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-03-08 04:39:52,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:39:52,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:39:52,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:39:52,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:39:52,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:52,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:52,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:53,010 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 04:39:53,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:53,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:53,012 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:53,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:53,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:53,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:53,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:39:53,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:39:53,015 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:39:53,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:39:53,016 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (1/1) ... [2025-03-08 04:39:53,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:39:53,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:39:53,046 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:39:53,063 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:39:53,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:39:53,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:39:53,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:39:53,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:39:53,118 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:39:53,120 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:39:53,249 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 04:39:53,249 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:39:53,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:39:53,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:39:53,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:39:53 BoogieIcfgContainer [2025-03-08 04:39:53,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:39:53,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:39:53,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:39:53,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:39:53,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:39:52" (1/3) ... [2025-03-08 04:39:53,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f2dc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:39:53, skipping insertion in model container [2025-03-08 04:39:53,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:39:52" (2/3) ... [2025-03-08 04:39:53,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f2dc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:39:53, skipping insertion in model container [2025-03-08 04:39:53,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:39:53" (3/3) ... [2025-03-08 04:39:53,262 INFO L128 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2025-03-08 04:39:53,272 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:39:53,274 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG diamond_2-2.c that has 1 procedures, 20 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 04:39:53,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:39:53,319 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;@76b1769a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:39:53,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:39:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:39:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 04:39:53,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:39:53,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 04:39:53,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:39:53,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:39:53,333 INFO L85 PathProgramCache]: Analyzing trace with hash 57205606, now seen corresponding path program 1 times [2025-03-08 04:39:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:39:53,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687003617] [2025-03-08 04:39:53,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:39:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:39:53,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 04:39:53,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 04:39:53,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:39:53,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:39:53,504 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:39:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:39:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687003617] [2025-03-08 04:39:53,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687003617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:39:53,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:39:53,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:39:53,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586386330] [2025-03-08 04:39:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:39:53,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:39:53,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:39:53,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:39:53,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:39:53,526 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:39:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:39:53,576 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2025-03-08 04:39:53,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:39:53,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 04:39:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:39:53,583 INFO L225 Difference]: With dead ends: 29 [2025-03-08 04:39:53,583 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 04:39:53,586 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:39:53,588 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:39:53,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:39:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 04:39:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-03-08 04:39:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:39:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2025-03-08 04:39:53,608 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 5 [2025-03-08 04:39:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:39:53,608 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 27 transitions. [2025-03-08 04:39:53,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:39:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 27 transitions. [2025-03-08 04:39:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:39:53,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:39:53,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:39:53,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:39:53,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:39:53,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:39:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1505622996, now seen corresponding path program 1 times [2025-03-08 04:39:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:39:53,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079972116] [2025-03-08 04:39:53,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:39:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:39:53,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:39:53,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:39:53,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:39:53,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:39:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:39:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:39:53,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079972116] [2025-03-08 04:39:53,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079972116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:39:53,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425313761] [2025-03-08 04:39:53,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:39:53,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:39:53,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:39:53,927 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:39:53,928 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:39:53,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:39:53,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:39:53,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:39:53,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:39:53,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 04:39:53,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:39:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:39:54,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:39:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:39:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425313761] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:39:54,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:39:54,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 04:39:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022347040] [2025-03-08 04:39:54,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:39:54,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 04:39:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:39:54,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 04:39:54,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-03-08 04:39:54,338 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:40:07,636 INFO L93 Difference]: Finished difference Result 330 states and 649 transitions. [2025-03-08 04:40:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-08 04:40:07,637 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 04:40:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:40:07,639 INFO L225 Difference]: With dead ends: 330 [2025-03-08 04:40:07,641 INFO L226 Difference]: Without dead ends: 327 [2025-03-08 04:40:07,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1146, Invalid=2160, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 04:40:07,643 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 108 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 2828 mSolverCounterSat, 1707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 4535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1707 IncrementalHoareTripleChecker+Valid, 2828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 04:40:07,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 40 Invalid, 4535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1707 Valid, 2828 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 04:40:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-08 04:40:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 266. [2025-03-08 04:40:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.9018867924528302) internal successors, (504), 265 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 504 transitions. [2025-03-08 04:40:07,684 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 504 transitions. Word has length 16 [2025-03-08 04:40:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:40:07,684 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 504 transitions. [2025-03-08 04:40:07,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 504 transitions. [2025-03-08 04:40:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:40:07,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:40:07,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:40:07,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:40:07,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:40:07,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:40:07,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:40:07,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1242094158, now seen corresponding path program 1 times [2025-03-08 04:40:07,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:40:07,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611055059] [2025-03-08 04:40:07,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:40:07,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:40:07,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:40:07,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:40:07,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:40:07,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:40:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:40:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:40:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611055059] [2025-03-08 04:40:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611055059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:40:07,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:40:07,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:40:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393415681] [2025-03-08 04:40:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:40:07,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:40:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:40:07,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:40:07,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:40:07,936 INFO L87 Difference]: Start difference. First operand 266 states and 504 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:40:07,978 INFO L93 Difference]: Finished difference Result 377 states and 714 transitions. [2025-03-08 04:40:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:40:07,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 04:40:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:40:07,979 INFO L225 Difference]: With dead ends: 377 [2025-03-08 04:40:07,979 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 04:40:07,980 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:40:07,980 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:40:07,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:40:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 04:40:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 50. [2025-03-08 04:40:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2025-03-08 04:40:07,991 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 16 [2025-03-08 04:40:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:40:07,991 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-03-08 04:40:07,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2025-03-08 04:40:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:40:07,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:40:07,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:40:07,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:40:07,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:40:07,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:40:07,993 INFO L85 PathProgramCache]: Analyzing trace with hash 200250069, now seen corresponding path program 1 times [2025-03-08 04:40:07,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:40:07,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268184099] [2025-03-08 04:40:07,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:40:07,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:40:07,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:40:08,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:40:08,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:40:08,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:40:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:40:08,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:40:08,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268184099] [2025-03-08 04:40:08,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268184099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:40:08,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:40:08,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:40:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864257505] [2025-03-08 04:40:08,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:40:08,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:40:08,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:40:08,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:40:08,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:40:08,027 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:40:08,049 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2025-03-08 04:40:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:40:08,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 04:40:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:40:08,050 INFO L225 Difference]: With dead ends: 74 [2025-03-08 04:40:08,050 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 04:40:08,050 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:40:08,051 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:40:08,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:40:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 04:40:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 04:40:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-03-08 04:40:08,054 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 16 [2025-03-08 04:40:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:40:08,054 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-03-08 04:40:08,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2025-03-08 04:40:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:40:08,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:40:08,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:40:08,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:40:08,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:40:08,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:40:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash 200279860, now seen corresponding path program 1 times [2025-03-08 04:40:08,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:40:08,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523416057] [2025-03-08 04:40:08,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:40:08,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:40:08,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:40:08,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:40:08,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:40:08,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:40:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:40:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:40:08,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523416057] [2025-03-08 04:40:08,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523416057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:40:08,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146751568] [2025-03-08 04:40:08,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:40:08,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:40:08,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:40:08,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:40:08,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:40:08,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:40:08,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:40:08,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:40:08,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:40:08,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 04:40:08,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:40:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:40:08,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:40:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:40:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146751568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:40:08,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:40:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 13 [2025-03-08 04:40:08,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147134232] [2025-03-08 04:40:08,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:40:08,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:40:08,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:40:08,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:40:08,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:40:08,564 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:40:08,667 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2025-03-08 04:40:08,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:40:08,667 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 04:40:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:40:08,668 INFO L225 Difference]: With dead ends: 61 [2025-03-08 04:40:08,668 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 04:40:08,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:40:08,669 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:40:08,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:40:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 04:40:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 04:40:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 04:40:08,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2025-03-08 04:40:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:40:08,671 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 04:40:08,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:40:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 04:40:08,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 04:40:08,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:40:08,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:40:08,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:40:08,882 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 04:40:08,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 04:40:08,926 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:40:08,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:40:08 BoogieIcfgContainer [2025-03-08 04:40:08,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:40:08,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:40:08,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:40:08,939 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:40:08,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:39:53" (3/4) ... [2025-03-08 04:40:08,941 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 04:40:08,950 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-08 04:40:08,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 04:40:08,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 04:40:08,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 04:40:09,001 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:40:09,002 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:40:09,002 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:40:09,004 INFO L158 Benchmark]: Toolchain (without parser) took 16208.69ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 113.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2025-03-08 04:40:09,004 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:40:09,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.54ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 112.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:40:09,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.35ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:40:09,006 INFO L158 Benchmark]: Boogie Preprocessor took 26.22ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.1MB in the end (delta: 907.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:40:09,006 INFO L158 Benchmark]: IcfgBuilder took 240.59ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 97.9MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:40:09,006 INFO L158 Benchmark]: TraceAbstraction took 15682.23ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 118.7MB in the end (delta: -21.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:40:09,006 INFO L158 Benchmark]: Witness Printer took 62.91ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 113.7MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:40:09,007 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.54ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 112.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.35ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.22ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.1MB in the end (delta: 907.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 240.59ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 97.9MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15682.23ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 118.7MB in the end (delta: -21.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.91ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 113.7MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 31 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 1757 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3064 IncrementalHoareTripleChecker+Invalid, 4821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1757 mSolverCounterUnsat, 67 mSDtfsCounter, 3064 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=2, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 125 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 654 SizeOfPredicates, 1 NumberOfNonLiveVariables, 136 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 2/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Location Invariant Derived location invariant: (((((y % 2) == 0) && (1 <= (((long long) x + 1) % 2))) || (x == 0)) || ((((long long) 5 + x) == 0) && ((y % 2) != 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 04:40:09,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE