./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:11:22,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:11:22,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:11:22,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:11:22,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:11:22,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:11:22,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:11:22,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:11:22,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:11:22,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:11:22,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:11:22,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:11:22,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:11:22,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:11:22,777 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:11:22,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:11:22,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:11:22,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:11:22,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:11:22,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:11:22,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:11:22,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:11:22,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:11:22,779 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 [2025-02-08 00:11:23,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:11:23,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:11:23,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:11:23,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:11:23,017 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:11:23,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2025-02-08 00:11:24,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08df6136a/395c9c1307404bb2ba0be2c76ca64862/FLAG4e109d632 [2025-02-08 00:11:24,739 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:11:24,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2025-02-08 00:11:24,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08df6136a/395c9c1307404bb2ba0be2c76ca64862/FLAG4e109d632 [2025-02-08 00:11:24,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08df6136a/395c9c1307404bb2ba0be2c76ca64862 [2025-02-08 00:11:24,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:11:24,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:11:24,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:11:24,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:11:24,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:11:24,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:24" (1/1) ... [2025-02-08 00:11:24,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702fe935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:24, skipping insertion in model container [2025-02-08 00:11:24,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:24" (1/1) ... [2025-02-08 00:11:24,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:11:24,932 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2025-02-08 00:11:25,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:11:25,064 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:11:25,071 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2025-02-08 00:11:25,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:11:25,157 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:11:25,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25 WrapperNode [2025-02-08 00:11:25,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:11:25,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:11:25,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:11:25,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:11:25,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,254 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 931 [2025-02-08 00:11:25,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:11:25,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:11:25,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:11:25,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:11:25,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,342 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-02-08 00:11:25,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:11:25,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:11:25,425 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:11:25,425 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:11:25,426 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (1/1) ... [2025-02-08 00:11:25,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:11:25,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:25,458 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-08 00:11:25,467 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-08 00:11:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:11:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:11:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:11:25,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:11:25,616 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:11:25,618 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:11:26,520 INFO L? ?]: Removed 450 outVars from TransFormulas that were not future-live. [2025-02-08 00:11:26,520 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:11:26,560 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:11:26,561 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:11:26,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:26 BoogieIcfgContainer [2025-02-08 00:11:26,561 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:11:26,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:11:26,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:11:26,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:11:26,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:11:24" (1/3) ... [2025-02-08 00:11:26,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d8448b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:26, skipping insertion in model container [2025-02-08 00:11:26,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:25" (2/3) ... [2025-02-08 00:11:26,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d8448b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:26, skipping insertion in model container [2025-02-08 00:11:26,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:26" (3/3) ... [2025-02-08 00:11:26,569 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2025-02-08 00:11:26,579 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:11:26,580 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c that has 1 procedures, 240 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:11:26,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:11:26,627 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;@2aeea976, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:11:26,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:11:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.5) internal successors, (357), 239 states have internal predecessors, (357), 0 states have call successors, (0), 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-02-08 00:11:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-08 00:11:26,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:26,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:26,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:26,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:26,647 INFO L85 PathProgramCache]: Analyzing trace with hash -413410571, now seen corresponding path program 1 times [2025-02-08 00:11:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:26,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510292919] [2025-02-08 00:11:26,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:26,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:26,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 00:11:26,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 00:11:26,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:26,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:27,768 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-08 00:11:27,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:27,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510292919] [2025-02-08 00:11:27,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510292919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:27,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:27,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:27,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476538147] [2025-02-08 00:11:27,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:27,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:11:27,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:27,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:11:27,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:27,801 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.5) internal successors, (357), 239 states have internal predecessors, (357), 0 states have call successors, (0), 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 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-08 00:11:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:28,035 INFO L93 Difference]: Finished difference Result 411 states and 613 transitions. [2025-02-08 00:11:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:28,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-02-08 00:11:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:28,044 INFO L225 Difference]: With dead ends: 411 [2025-02-08 00:11:28,044 INFO L226 Difference]: Without dead ends: 240 [2025-02-08 00:11:28,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:28,049 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:28,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 877 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-08 00:11:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-02-08 00:11:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 0 states have call successors, (0), 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-02-08 00:11:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2025-02-08 00:11:28,091 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 110 [2025-02-08 00:11:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:28,092 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2025-02-08 00:11:28,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-08 00:11:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2025-02-08 00:11:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-08 00:11:28,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:28,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:28,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:11:28,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:28,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash 73853365, now seen corresponding path program 1 times [2025-02-08 00:11:28,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:28,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203643367] [2025-02-08 00:11:28,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:28,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 00:11:28,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 00:11:28,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:28,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:28,670 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-08 00:11:28,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:28,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203643367] [2025-02-08 00:11:28,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203643367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:28,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:28,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792817069] [2025-02-08 00:11:28,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:28,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:11:28,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:28,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:11:28,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:28,672 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:28,992 INFO L93 Difference]: Finished difference Result 413 states and 612 transitions. [2025-02-08 00:11:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:28,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-02-08 00:11:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:28,998 INFO L225 Difference]: With dead ends: 413 [2025-02-08 00:11:28,998 INFO L226 Difference]: Without dead ends: 242 [2025-02-08 00:11:28,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:28,999 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:29,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 874 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:11:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-08 00:11:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-02-08 00:11:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4854771784232366) internal successors, (358), 241 states have internal predecessors, (358), 0 states have call successors, (0), 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-02-08 00:11:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 358 transitions. [2025-02-08 00:11:29,018 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 358 transitions. Word has length 111 [2025-02-08 00:11:29,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:29,018 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 358 transitions. [2025-02-08 00:11:29,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 358 transitions. [2025-02-08 00:11:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 00:11:29,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:29,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:29,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:11:29,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:29,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:29,020 INFO L85 PathProgramCache]: Analyzing trace with hash -74003728, now seen corresponding path program 1 times [2025-02-08 00:11:29,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:29,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469478128] [2025-02-08 00:11:29,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:29,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:29,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 00:11:29,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 00:11:29,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:29,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:29,922 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-08 00:11:29,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:29,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469478128] [2025-02-08 00:11:29,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469478128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:29,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:29,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:11:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863468319] [2025-02-08 00:11:29,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:29,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:11:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:29,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:11:29,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:29,926 INFO L87 Difference]: Start difference. First operand 242 states and 358 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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-02-08 00:11:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:30,073 INFO L93 Difference]: Finished difference Result 415 states and 613 transitions. [2025-02-08 00:11:30,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:11:30,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-02-08 00:11:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:30,075 INFO L225 Difference]: With dead ends: 415 [2025-02-08 00:11:30,077 INFO L226 Difference]: Without dead ends: 242 [2025-02-08 00:11:30,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:11:30,078 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 18 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:30,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 849 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:11:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-08 00:11:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-02-08 00:11:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4813278008298756) internal successors, (357), 241 states have internal predecessors, (357), 0 states have call successors, (0), 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-02-08 00:11:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 357 transitions. [2025-02-08 00:11:30,091 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 357 transitions. Word has length 112 [2025-02-08 00:11:30,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:30,091 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 357 transitions. [2025-02-08 00:11:30,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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-02-08 00:11:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 357 transitions. [2025-02-08 00:11:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-08 00:11:30,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:30,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:30,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:11:30,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:30,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash -405753030, now seen corresponding path program 1 times [2025-02-08 00:11:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:30,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016044455] [2025-02-08 00:11:30,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:30,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:30,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 00:11:30,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 00:11:30,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:30,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:30,998 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-08 00:11:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016044455] [2025-02-08 00:11:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016044455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:11:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944383106] [2025-02-08 00:11:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:31,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:11:31,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:31,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:11:31,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:11:31,001 INFO L87 Difference]: Start difference. First operand 242 states and 357 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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-02-08 00:11:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:31,253 INFO L93 Difference]: Finished difference Result 419 states and 617 transitions. [2025-02-08 00:11:31,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:11:31,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-02-08 00:11:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:31,255 INFO L225 Difference]: With dead ends: 419 [2025-02-08 00:11:31,255 INFO L226 Difference]: Without dead ends: 246 [2025-02-08 00:11:31,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:11:31,256 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 271 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:31,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1365 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-08 00:11:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2025-02-08 00:11:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.4754098360655739) internal successors, (360), 244 states have internal predecessors, (360), 0 states have call successors, (0), 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-02-08 00:11:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 360 transitions. [2025-02-08 00:11:31,270 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 360 transitions. Word has length 113 [2025-02-08 00:11:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:31,272 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 360 transitions. [2025-02-08 00:11:31,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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-02-08 00:11:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 360 transitions. [2025-02-08 00:11:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-08 00:11:31,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:31,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:31,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:11:31,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:31,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:31,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1270658510, now seen corresponding path program 1 times [2025-02-08 00:11:31,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:31,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258682895] [2025-02-08 00:11:31,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:31,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:31,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 00:11:31,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 00:11:31,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:31,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:32,049 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-08 00:11:32,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:32,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258682895] [2025-02-08 00:11:32,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258682895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:32,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:32,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:11:32,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216434972] [2025-02-08 00:11:32,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:32,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:11:32,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:32,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:11:32,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:11:32,051 INFO L87 Difference]: Start difference. First operand 245 states and 360 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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-02-08 00:11:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:32,243 INFO L93 Difference]: Finished difference Result 430 states and 629 transitions. [2025-02-08 00:11:32,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:11:32,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-02-08 00:11:32,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:32,245 INFO L225 Difference]: With dead ends: 430 [2025-02-08 00:11:32,245 INFO L226 Difference]: Without dead ends: 254 [2025-02-08 00:11:32,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:11:32,246 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 5 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:32,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1433 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-08 00:11:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2025-02-08 00:11:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4698795180722892) internal successors, (366), 249 states have internal predecessors, (366), 0 states have call successors, (0), 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-02-08 00:11:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 366 transitions. [2025-02-08 00:11:32,261 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 366 transitions. Word has length 114 [2025-02-08 00:11:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:32,262 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 366 transitions. [2025-02-08 00:11:32,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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-02-08 00:11:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 366 transitions. [2025-02-08 00:11:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-08 00:11:32,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:32,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:32,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:11:32,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:32,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:32,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1966486791, now seen corresponding path program 1 times [2025-02-08 00:11:32,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:32,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999540449] [2025-02-08 00:11:32,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:32,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:32,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 00:11:32,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 00:11:32,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:32,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:33,574 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-08 00:11:33,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:33,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999540449] [2025-02-08 00:11:33,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999540449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:33,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:33,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 00:11:33,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122964685] [2025-02-08 00:11:33,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:33,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 00:11:33,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:33,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 00:11:33,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:11:33,578 INFO L87 Difference]: Start difference. First operand 250 states and 366 transitions. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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-02-08 00:11:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:34,022 INFO L93 Difference]: Finished difference Result 460 states and 670 transitions. [2025-02-08 00:11:34,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:11:34,023 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-02-08 00:11:34,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:34,025 INFO L225 Difference]: With dead ends: 460 [2025-02-08 00:11:34,025 INFO L226 Difference]: Without dead ends: 279 [2025-02-08 00:11:34,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:11:34,027 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 308 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:34,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1914 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:11:34,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-08 00:11:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-02-08 00:11:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.463768115942029) internal successors, (404), 276 states have internal predecessors, (404), 0 states have call successors, (0), 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-02-08 00:11:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 404 transitions. [2025-02-08 00:11:34,038 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 404 transitions. Word has length 114 [2025-02-08 00:11:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:34,038 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 404 transitions. [2025-02-08 00:11:34,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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-02-08 00:11:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 404 transitions. [2025-02-08 00:11:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 00:11:34,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:34,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:34,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:11:34,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:34,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash 767763594, now seen corresponding path program 1 times [2025-02-08 00:11:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:34,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744033426] [2025-02-08 00:11:34,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:34,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 00:11:34,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 00:11:34,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:34,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:34,848 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-08 00:11:34,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:34,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744033426] [2025-02-08 00:11:34,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744033426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:34,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:34,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:11:34,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907605318] [2025-02-08 00:11:34,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:34,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:11:34,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:34,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:11:34,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:11:34,852 INFO L87 Difference]: Start difference. First operand 277 states and 404 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 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-02-08 00:11:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:35,202 INFO L93 Difference]: Finished difference Result 549 states and 800 transitions. [2025-02-08 00:11:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:11:35,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-08 00:11:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:35,204 INFO L225 Difference]: With dead ends: 549 [2025-02-08 00:11:35,204 INFO L226 Difference]: Without dead ends: 341 [2025-02-08 00:11:35,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:11:35,205 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 426 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:35,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1711 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:11:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-02-08 00:11:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 315. [2025-02-08 00:11:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.464968152866242) internal successors, (460), 314 states have internal predecessors, (460), 0 states have call successors, (0), 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-02-08 00:11:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 460 transitions. [2025-02-08 00:11:35,216 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 460 transitions. Word has length 115 [2025-02-08 00:11:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:35,216 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 460 transitions. [2025-02-08 00:11:35,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 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-02-08 00:11:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 460 transitions. [2025-02-08 00:11:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 00:11:35,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:35,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:35,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:11:35,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:35,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash -444969055, now seen corresponding path program 1 times [2025-02-08 00:11:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:35,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972221201] [2025-02-08 00:11:35,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:35,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:35,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 00:11:35,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 00:11:35,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:35,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:35,853 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-08 00:11:35,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:35,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972221201] [2025-02-08 00:11:35,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972221201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:35,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:35,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:11:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153558668] [2025-02-08 00:11:35,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:35,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:11:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:35,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:11:35,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:11:35,854 INFO L87 Difference]: Start difference. First operand 315 states and 460 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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-02-08 00:11:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:36,122 INFO L93 Difference]: Finished difference Result 751 states and 1101 transitions. [2025-02-08 00:11:36,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:11:36,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-08 00:11:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:36,126 INFO L225 Difference]: With dead ends: 751 [2025-02-08 00:11:36,126 INFO L226 Difference]: Without dead ends: 505 [2025-02-08 00:11:36,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:11:36,128 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 712 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:36,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 740 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:11:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-08 00:11:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 503. [2025-02-08 00:11:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.4741035856573705) internal successors, (740), 502 states have internal predecessors, (740), 0 states have call successors, (0), 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-02-08 00:11:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 740 transitions. [2025-02-08 00:11:36,153 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 740 transitions. Word has length 115 [2025-02-08 00:11:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:36,154 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 740 transitions. [2025-02-08 00:11:36,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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-02-08 00:11:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 740 transitions. [2025-02-08 00:11:36,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 00:11:36,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:36,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:36,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:11:36,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:36,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:36,155 INFO L85 PathProgramCache]: Analyzing trace with hash -745668091, now seen corresponding path program 1 times [2025-02-08 00:11:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:36,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400901617] [2025-02-08 00:11:36,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:36,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 00:11:36,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 00:11:36,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:36,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:11:36,802 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-08 00:11:36,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:11:36,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400901617] [2025-02-08 00:11:36,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400901617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:11:36,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:11:36,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:11:36,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575171160] [2025-02-08 00:11:36,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:11:36,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:11:36,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:11:36,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:11:36,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:11:36,804 INFO L87 Difference]: Start difference. First operand 503 states and 740 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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-02-08 00:11:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:11:37,267 INFO L93 Difference]: Finished difference Result 921 states and 1346 transitions. [2025-02-08 00:11:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 00:11:37,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-08 00:11:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:11:37,270 INFO L225 Difference]: With dead ends: 921 [2025-02-08 00:11:37,270 INFO L226 Difference]: Without dead ends: 507 [2025-02-08 00:11:37,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:11:37,271 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 491 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:11:37,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 2076 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:11:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-02-08 00:11:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-02-08 00:11:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.466403162055336) internal successors, (742), 506 states have internal predecessors, (742), 0 states have call successors, (0), 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-02-08 00:11:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 742 transitions. [2025-02-08 00:11:37,285 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 742 transitions. Word has length 115 [2025-02-08 00:11:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:11:37,285 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 742 transitions. [2025-02-08 00:11:37,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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-02-08 00:11:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 742 transitions. [2025-02-08 00:11:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-08 00:11:37,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:37,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:11:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:11:37,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:37,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1585527852, now seen corresponding path program 1 times [2025-02-08 00:11:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:11:37,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735825620] [2025-02-08 00:11:37,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:11:37,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 00:11:37,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 00:11:37,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:37,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:11:37,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:11:37,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 00:11:37,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 00:11:37,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:37,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:11:37,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:11:37,609 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:11:37,610 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:11:37,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:11:37,613 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:11:37,689 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:11:37,717 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:11:37,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:11:37 BoogieIcfgContainer [2025-02-08 00:11:37,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:11:37,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:11:37,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:11:37,724 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:11:37,728 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:26" (3/4) ... [2025-02-08 00:11:37,730 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:11:37,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:11:37,731 INFO L158 Benchmark]: Toolchain (without parser) took 12945.86ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 113.9MB in the beginning and 396.7MB in the end (delta: -282.8MB). Peak memory consumption was 308.6MB. Max. memory is 16.1GB. [2025-02-08 00:11:37,731 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:11:37,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.65ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 92.1MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 00:11:37,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.68ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 73.2MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:11:37,732 INFO L158 Benchmark]: Boogie Preprocessor took 167.93ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 63.6MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:11:37,732 INFO L158 Benchmark]: IcfgBuilder took 1136.21ms. Allocated memory is still 142.6MB. Free memory was 63.6MB in the beginning and 64.6MB in the end (delta: -906.8kB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2025-02-08 00:11:37,732 INFO L158 Benchmark]: TraceAbstraction took 11160.18ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 64.6MB in the beginning and 397.0MB in the end (delta: -332.4MB). Peak memory consumption was 250.0MB. Max. memory is 16.1GB. [2025-02-08 00:11:37,732 INFO L158 Benchmark]: Witness Printer took 6.82ms. Allocated memory is still 729.8MB. Free memory was 397.0MB in the beginning and 396.7MB in the end (delta: 230.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:11:37,733 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.36ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.65ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 92.1MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.68ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 73.2MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 167.93ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 63.6MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1136.21ms. Allocated memory is still 142.6MB. Free memory was 63.6MB in the beginning and 64.6MB in the end (delta: -906.8kB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11160.18ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 64.6MB in the beginning and 397.0MB in the end (delta: -332.4MB). Peak memory consumption was 250.0MB. Max. memory is 16.1GB. * Witness Printer took 6.82ms. Allocated memory is still 729.8MB. Free memory was 397.0MB in the beginning and 396.7MB in the end (delta: 230.7kB). 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 325, overapproximation of bitwiseAnd at line 332. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 2); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (2 - 1); [L38] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 5); [L39] const SORT_43 msb_SORT_43 = (SORT_43)1 << (5 - 1); [L41] const SORT_21 var_22 = 0; [L42] const SORT_21 var_23 = 1; [L43] const SORT_1 var_24 = 0; [L44] const SORT_3 var_28 = 1; [L45] const SORT_3 var_34 = 0; [L46] const SORT_43 var_45 = 31; [L47] const SORT_21 var_49 = 2; [L48] const SORT_21 var_66 = 3; [L49] const SORT_6 var_89 = 0; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_119; [L69] SORT_3 input_123; [L70] SORT_1 input_125; [L71] SORT_3 input_127; [L72] SORT_21 input_130; [L73] SORT_3 input_132; [L74] SORT_6 input_135; [L75] SORT_3 input_137; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L78] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L79] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L80] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L81] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L82] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L83] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L84] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L85] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L86] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L87] SORT_3 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L88] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L89] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L89] SORT_6 state_92 = __VERIFIER_nondet_uint() & mask_SORT_6; [L90] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L90] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L91] SORT_1 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L92] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L93] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_26_arg_1 = var_24; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_31_arg_1 = var_24; [L98] state_30 = init_31_arg_1 [L99] SORT_3 init_36_arg_1 = var_34; [L100] state_35 = init_36_arg_1 [L101] SORT_3 init_40_arg_1 = var_34; [L102] state_39 = init_40_arg_1 [L103] SORT_1 init_52_arg_1 = var_24; [L104] state_51 = init_52_arg_1 [L105] SORT_3 init_56_arg_1 = var_34; [L106] state_55 = init_56_arg_1 [L107] SORT_3 init_60_arg_1 = var_34; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_69_arg_1 = var_24; [L110] state_68 = init_69_arg_1 [L111] SORT_3 init_73_arg_1 = var_34; [L112] state_72 = init_73_arg_1 [L113] SORT_3 init_77_arg_1 = var_34; [L114] state_76 = init_77_arg_1 [L115] SORT_3 init_81_arg_1 = var_34; [L116] state_80 = init_81_arg_1 [L117] SORT_6 init_91_arg_1 = var_89; [L118] state_90 = init_91_arg_1 [L119] SORT_6 init_93_arg_1 = var_89; [L120] state_92 = init_93_arg_1 [L121] SORT_6 init_97_arg_1 = var_89; [L122] state_96 = init_97_arg_1 [L123] SORT_1 init_116_arg_1 = var_24; [L124] state_115 = init_116_arg_1 [L125] SORT_3 init_118_arg_1 = var_34; [L126] state_117 = init_118_arg_1 [L127] SORT_3 init_122_arg_1 = var_34; [L128] state_121 = init_122_arg_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] EXPR input_5 & mask_SORT_1 VAL [input_4=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] EXPR input_8 & mask_SORT_3 VAL [input_4=0, input_5=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] EXPR input_10 & mask_SORT_1 VAL [input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] EXPR input_11 & mask_SORT_1 VAL [input_10=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] EXPR input_14 & mask_SORT_3 VAL [input_10=0, input_11=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] EXPR input_16 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] EXPR input_17 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] EXPR input_18 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] EXPR input_19 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_119 = __VERIFIER_nondet_uchar() [L159] input_123 = __VERIFIER_nondet_uchar() [L160] input_125 = __VERIFIER_nondet_uchar() [L161] input_127 = __VERIFIER_nondet_uchar() [L162] input_130 = __VERIFIER_nondet_uchar() [L163] input_132 = __VERIFIER_nondet_uchar() [L164] input_135 = __VERIFIER_nondet_uint() [L165] input_137 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_27_arg_0 = state_25; [L169] SORT_3 var_27 = var_27_arg_0 >> 5; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L170] EXPR var_27 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L170] var_27 = var_27 & mask_SORT_3 [L171] SORT_3 var_67_arg_0 = var_27; [L172] SORT_3 var_67_arg_1 = var_28; [L173] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L174] SORT_1 var_70_arg_0 = state_25; [L175] SORT_1 var_70_arg_1 = state_68; [L176] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L177] SORT_3 var_71_arg_0 = var_67; [L178] SORT_3 var_71_arg_1 = var_70; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_71_arg_0=0, var_71_arg_1=1, var_89=0] [L179] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L179] SORT_3 var_71 = var_71_arg_0 & var_71_arg_1; [L180] SORT_3 var_74_arg_0 = state_72; [L181] SORT_3 var_74_arg_1 = var_28; [L182] SORT_3 var_74 = var_74_arg_0 != var_74_arg_1; [L183] SORT_3 var_75_arg_0 = var_71; [L184] SORT_3 var_75_arg_1 = var_74; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_75_arg_0=0, var_75_arg_1=1, var_89=0] [L185] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L185] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L186] SORT_3 var_78_arg_0 = state_76; [L187] SORT_3 var_78_arg_1 = var_28; [L188] SORT_3 var_78 = var_78_arg_0 == var_78_arg_1; [L189] SORT_3 var_79_arg_0 = var_75; [L190] SORT_3 var_79_arg_1 = var_78; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_79_arg_0=0, var_79_arg_1=0, var_89=0] [L191] EXPR var_79_arg_0 & var_79_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L191] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L192] SORT_3 var_82_arg_0 = state_80; [L193] SORT_3 var_82_arg_1 = var_28; [L194] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L195] SORT_3 var_83_arg_0 = var_79; [L196] SORT_3 var_83_arg_1 = var_82; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_83_arg_0=0, var_83_arg_1=0, var_89=0] [L197] EXPR var_83_arg_0 & var_83_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L197] SORT_3 var_83 = var_83_arg_0 & var_83_arg_1; [L198] SORT_1 var_44_arg_0 = state_25; [L199] SORT_43 var_44 = var_44_arg_0 >> 0; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_83=0, var_89=0] [L200] EXPR var_44 & mask_SORT_43 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_83=0, var_89=0] [L200] var_44 = var_44 & mask_SORT_43 [L201] SORT_43 var_84_arg_0 = var_44; [L202] SORT_43 var_84_arg_1 = var_45; [L203] SORT_3 var_84 = var_84_arg_0 != var_84_arg_1; [L204] SORT_3 var_85_arg_0 = var_83; [L205] SORT_3 var_85_arg_1 = var_84; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85_arg_0=0, var_85_arg_1=1, var_89=0] [L206] EXPR var_85_arg_0 & var_85_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L206] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L207] EXPR var_85 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L207] var_85 = var_85 & mask_SORT_3 [L208] SORT_3 var_50_arg_0 = var_27; [L209] SORT_3 var_50_arg_1 = var_28; [L210] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L211] SORT_1 var_53_arg_0 = state_25; [L212] SORT_1 var_53_arg_1 = state_51; [L213] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L214] SORT_3 var_54_arg_0 = var_50; [L215] SORT_3 var_54_arg_1 = var_53; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_54_arg_0=0, var_54_arg_1=1, var_66=3, var_85=0, var_89=0] [L216] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L216] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L217] SORT_3 var_57_arg_0 = state_55; [L218] SORT_3 var_57_arg_1 = var_28; [L219] SORT_3 var_57 = var_57_arg_0 == var_57_arg_1; [L220] SORT_3 var_58_arg_0 = var_54; [L221] SORT_3 var_58_arg_1 = var_57; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_58_arg_0=0, var_58_arg_1=0, var_66=3, var_85=0, var_89=0] [L222] EXPR var_58_arg_0 & var_58_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L222] SORT_3 var_58 = var_58_arg_0 & var_58_arg_1; [L223] SORT_3 var_61_arg_0 = state_59; [L224] SORT_3 var_61_arg_1 = var_28; [L225] SORT_3 var_61 = var_61_arg_0 == var_61_arg_1; [L226] SORT_3 var_62_arg_0 = var_58; [L227] SORT_3 var_62_arg_1 = var_61; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_62_arg_0=0, var_62_arg_1=0, var_66=3, var_85=0, var_89=0] [L228] EXPR var_62_arg_0 & var_62_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L228] SORT_3 var_62 = var_62_arg_0 & var_62_arg_1; [L229] SORT_43 var_63_arg_0 = var_44; [L230] SORT_43 var_63_arg_1 = var_45; [L231] SORT_3 var_63 = var_63_arg_0 != var_63_arg_1; [L232] SORT_3 var_64_arg_0 = var_62; [L233] SORT_3 var_64_arg_1 = var_63; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_64_arg_0=0, var_64_arg_1=1, var_66=3, var_85=0, var_89=0] [L234] EXPR var_64_arg_0 & var_64_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L234] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L235] EXPR var_64 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L235] var_64 = var_64 & mask_SORT_3 [L236] SORT_3 var_29_arg_0 = var_27; [L237] SORT_3 var_29_arg_1 = var_28; [L238] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L239] SORT_1 var_32_arg_0 = state_25; [L240] SORT_1 var_32_arg_1 = state_30; [L241] SORT_3 var_32 = var_32_arg_0 == var_32_arg_1; [L242] SORT_3 var_33_arg_0 = var_29; [L243] SORT_3 var_33_arg_1 = var_32; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_33_arg_0=0, var_33_arg_1=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L244] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L244] SORT_3 var_33 = var_33_arg_0 & var_33_arg_1; [L245] SORT_3 var_37_arg_0 = state_35; [L246] SORT_3 var_37_arg_1 = var_28; [L247] SORT_3 var_37 = var_37_arg_0 == var_37_arg_1; [L248] SORT_3 var_38_arg_0 = var_33; [L249] SORT_3 var_38_arg_1 = var_37; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_38_arg_0=0, var_38_arg_1=0, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L250] EXPR var_38_arg_0 & var_38_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L250] SORT_3 var_38 = var_38_arg_0 & var_38_arg_1; [L251] SORT_3 var_41_arg_0 = state_39; [L252] SORT_3 var_41_arg_1 = var_28; [L253] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L254] SORT_3 var_42_arg_0 = var_38; [L255] SORT_3 var_42_arg_1 = var_41; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_42_arg_0=0, var_42_arg_1=0, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L256] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L256] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L257] SORT_43 var_46_arg_0 = var_44; [L258] SORT_43 var_46_arg_1 = var_45; [L259] SORT_3 var_46 = var_46_arg_0 != var_46_arg_1; [L260] SORT_3 var_47_arg_0 = var_42; [L261] SORT_3 var_47_arg_1 = var_46; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_47_arg_0=0, var_47_arg_1=1, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L262] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L262] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L263] EXPR var_47 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L263] var_47 = var_47 & mask_SORT_3 [L264] SORT_3 var_48_arg_0 = var_47; [L265] SORT_21 var_48_arg_1 = var_23; [L266] SORT_21 var_48_arg_2 = var_22; [L267] SORT_21 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L268] SORT_3 var_65_arg_0 = var_64; [L269] SORT_21 var_65_arg_1 = var_49; [L270] SORT_21 var_65_arg_2 = var_48; [L271] SORT_21 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L272] SORT_3 var_86_arg_0 = var_85; [L273] SORT_21 var_86_arg_1 = var_66; [L274] SORT_21 var_86_arg_2 = var_65; [L275] SORT_21 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_86=0, var_89=0] [L276] EXPR var_86 & mask_SORT_21 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L276] var_86 = var_86 & mask_SORT_21 [L277] SORT_21 var_87_arg_0 = var_86; [L278] SORT_21 var_87_arg_1 = var_49; [L279] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L280] SORT_3 var_88_arg_0 = var_87; [L281] SORT_3 var_88 = ~var_88_arg_0; [L282] SORT_43 var_103_arg_0 = var_44; [L283] SORT_43 var_103_arg_1 = var_45; [L284] SORT_3 var_103 = var_103_arg_0 == var_103_arg_1; [L285] SORT_21 var_100_arg_0 = var_86; [L286] SORT_21 var_100_arg_1 = var_23; [L287] SORT_3 var_100 = var_100_arg_0 == var_100_arg_1; [L288] SORT_21 var_98_arg_0 = var_86; [L289] SORT_21 var_98_arg_1 = var_22; [L290] SORT_3 var_98 = var_98_arg_0 == var_98_arg_1; [L291] SORT_3 var_101_arg_0 = var_100; [L292] SORT_3 var_101_arg_1 = var_98; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_101_arg_0=0, var_101_arg_1=1, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L293] EXPR var_101_arg_0 | var_101_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L293] SORT_3 var_101 = var_101_arg_0 | var_101_arg_1; [L294] EXPR var_101 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L294] var_101 = var_101 & mask_SORT_3 [L295] SORT_3 var_99_arg_0 = var_98; [L296] SORT_6 var_99_arg_1 = var_89; [L297] SORT_6 var_99_arg_2 = state_96; [L298] SORT_6 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L299] SORT_21 var_94_arg_0 = var_86; [L300] SORT_21 var_94_arg_1 = var_49; [L301] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L302] SORT_3 var_95_arg_0 = var_94; [L303] SORT_6 var_95_arg_1 = state_92; [L304] SORT_6 var_95_arg_2 = state_90; [L305] SORT_6 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L306] SORT_3 var_102_arg_0 = var_101; [L307] SORT_6 var_102_arg_1 = var_99; [L308] SORT_6 var_102_arg_2 = var_95; [L309] SORT_6 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L310] SORT_3 var_104_arg_0 = var_103; [L311] SORT_6 var_104_arg_1 = var_89; [L312] SORT_6 var_104_arg_2 = var_102; [L313] SORT_6 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L314] SORT_6 var_105_arg_0 = var_104; [L315] SORT_1 var_105 = var_105_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_105=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L316] EXPR var_105 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L316] var_105 = var_105 & mask_SORT_1 [L317] SORT_6 var_106_arg_0 = state_90; [L318] SORT_1 var_106 = var_106_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_105=0, var_106=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L319] EXPR var_106 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_105=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L319] var_106 = var_106 & mask_SORT_1 [L320] SORT_1 var_107_arg_0 = var_105; [L321] SORT_1 var_107_arg_1 = var_106; [L322] SORT_3 var_107 = var_107_arg_0 == var_107_arg_1; [L323] SORT_3 var_108_arg_0 = var_88; [L324] SORT_3 var_108_arg_1 = var_107; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_108_arg_0=-1, var_108_arg_1=1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] EXPR var_108_arg_0 | var_108_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] SORT_3 var_108 = var_108_arg_0 | var_108_arg_1; [L326] SORT_3 var_109_arg_0 = var_108; [L327] SORT_3 var_109 = ~var_109_arg_0; [L328] SORT_3 var_112_arg_0 = var_109; [L329] SORT_3 var_112 = ~var_112_arg_0; [L330] SORT_3 var_113_arg_0 = var_28; [L331] SORT_3 var_113_arg_1 = var_112; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_113_arg_0=1, var_113_arg_1=-1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] EXPR var_113_arg_0 & var_113_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] SORT_3 var_113 = var_113_arg_0 & var_113_arg_1; [L333] EXPR var_113 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L333] var_113 = var_113 & mask_SORT_3 [L334] SORT_3 bad_114_arg_0 = var_113; [L335] CALL __VERIFIER_assert(!(bad_114_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2231 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2231 mSDsluCounter, 11839 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9200 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3290 IncrementalHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 2639 mSDtfsCounter, 3290 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=507occurred in iteration=9, InterpolantAutomatonStates: 61, 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, 9 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1135 NumberOfCodeBlocks, 1135 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1010 ConstructedInterpolants, 0 QuantifiedInterpolants, 4010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:11:37,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:11:40,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:11:40,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:11:40,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:11:40,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:11:40,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:11:40,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:11:40,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:11:40,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:11:40,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:11:40,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:11:40,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:11:40,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:11:40,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:11:40,243 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:11:40,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:11:40,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:11:40,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:11:40,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:11:40,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:11:40,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:11:40,244 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:11:40,244 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:11:40,244 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:11:40,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:11:40,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:11:40,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:11:40,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:11:40,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:11:40,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:11:40,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:11:40,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:11:40,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:11:40,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:11:40,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:11:40,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:11:40,246 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:11:40,246 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:11:40,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:11:40,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:11:40,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:11:40,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:11:40,246 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 [2025-02-08 00:11:40,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:11:40,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:11:40,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:11:40,524 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:11:40,525 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:11:40,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2025-02-08 00:11:41,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f720b3781/e7858781d50c495ebcd008aedc23b2d1/FLAG48d90e27a [2025-02-08 00:11:42,199 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:11:42,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2025-02-08 00:11:42,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f720b3781/e7858781d50c495ebcd008aedc23b2d1/FLAG48d90e27a [2025-02-08 00:11:42,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f720b3781/e7858781d50c495ebcd008aedc23b2d1 [2025-02-08 00:11:42,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:11:42,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:11:42,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:11:42,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:11:42,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:11:42,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dad7b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42, skipping insertion in model container [2025-02-08 00:11:42,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:11:42,387 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2025-02-08 00:11:42,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:11:42,508 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:11:42,516 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2025-02-08 00:11:42,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:11:42,565 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:11:42,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42 WrapperNode [2025-02-08 00:11:42,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:11:42,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:11:42,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:11:42,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:11:42,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,613 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 467 [2025-02-08 00:11:42,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:11:42,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:11:42,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:11:42,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:11:42,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,643 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-02-08 00:11:42,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:11:42,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:11:42,678 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:11:42,678 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:11:42,679 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (1/1) ... [2025-02-08 00:11:42,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:11:42,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:42,718 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-08 00:11:42,722 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-08 00:11:42,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:11:42,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:11:42,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:11:42,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:11:42,892 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:11:42,894 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:11:43,301 INFO L? ?]: Removed 205 outVars from TransFormulas that were not future-live. [2025-02-08 00:11:43,303 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:11:43,310 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:11:43,311 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:11:43,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:43 BoogieIcfgContainer [2025-02-08 00:11:43,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:11:43,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:11:43,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:11:43,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:11:43,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:11:42" (1/3) ... [2025-02-08 00:11:43,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fae8f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:43, skipping insertion in model container [2025-02-08 00:11:43,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:11:42" (2/3) ... [2025-02-08 00:11:43,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fae8f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:11:43, skipping insertion in model container [2025-02-08 00:11:43,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:43" (3/3) ... [2025-02-08 00:11:43,323 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2025-02-08 00:11:43,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:11:43,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:11:43,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:11:43,382 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;@42897d7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:11:43,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:11:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:11:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:11:43,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:11:43,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:11:43,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:11:43,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:11:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:11:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:11:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454448464] [2025-02-08 00:11:43,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:11:43,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:43,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:11:43,411 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-08 00:11:43,413 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-08 00:11:43,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:11:43,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:11:43,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:43,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:11:43,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:11:43,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:11:43,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:11:43,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:11:43,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:11:43,806 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 00:11:43,807 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:11:43,808 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:11:43,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 00:11:44,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:11:44,014 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 00:11:44,037 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:11:44,051 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:11:44,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:11:44 BoogieIcfgContainer [2025-02-08 00:11:44,056 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:11:44,056 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:11:44,056 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:11:44,057 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:11:44,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:11:43" (3/4) ... [2025-02-08 00:11:44,058 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 00:11:44,063 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:11:44,102 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 3. [2025-02-08 00:11:44,128 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 00:11:44,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 00:11:44,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:11:44,130 INFO L158 Benchmark]: Toolchain (without parser) took 1892.56ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 30.8MB in the end (delta: 61.0MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-02-08 00:11:44,130 INFO L158 Benchmark]: CDTParser took 4.11ms. Allocated memory is still 83.9MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:11:44,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.61ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 72.1MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:11:44,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.76ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 68.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:11:44,130 INFO L158 Benchmark]: Boogie Preprocessor took 60.16ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 64.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:11:44,131 INFO L158 Benchmark]: IcfgBuilder took 636.76ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 74.6MB in the end (delta: -9.7MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2025-02-08 00:11:44,131 INFO L158 Benchmark]: TraceAbstraction took 740.80ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 39.5MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 00:11:44,131 INFO L158 Benchmark]: Witness Printer took 72.23ms. Allocated memory is still 117.4MB. Free memory was 39.5MB in the beginning and 30.8MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:11:44,132 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.11ms. Allocated memory is still 83.9MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.61ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 72.1MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.76ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 68.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.16ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 64.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 636.76ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 74.6MB in the end (delta: -9.7MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 740.80ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 39.5MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 72.23ms. Allocated memory is still 117.4MB. Free memory was 39.5MB in the beginning and 30.8MB in the end (delta: 8.6MB). 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 2); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (2 - 1); [L38] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 5); [L39] const SORT_43 msb_SORT_43 = (SORT_43)1 << (5 - 1); [L41] const SORT_21 var_22 = 0; [L42] const SORT_21 var_23 = 1; [L43] const SORT_1 var_24 = 0; [L44] const SORT_3 var_28 = 1; [L45] const SORT_3 var_34 = 0; [L46] const SORT_43 var_45 = 31; [L47] const SORT_21 var_49 = 2; [L48] const SORT_21 var_66 = 3; [L49] const SORT_6 var_89 = 0; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_119; [L69] SORT_3 input_123; [L70] SORT_1 input_125; [L71] SORT_3 input_127; [L72] SORT_21 input_130; [L73] SORT_3 input_132; [L74] SORT_6 input_135; [L75] SORT_3 input_137; [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] SORT_3 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L89] SORT_6 state_92 = __VERIFIER_nondet_uint() & mask_SORT_6; [L90] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] SORT_1 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_26_arg_1 = var_24; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_31_arg_1 = var_24; [L98] state_30 = init_31_arg_1 [L99] SORT_3 init_36_arg_1 = var_34; [L100] state_35 = init_36_arg_1 [L101] SORT_3 init_40_arg_1 = var_34; [L102] state_39 = init_40_arg_1 [L103] SORT_1 init_52_arg_1 = var_24; [L104] state_51 = init_52_arg_1 [L105] SORT_3 init_56_arg_1 = var_34; [L106] state_55 = init_56_arg_1 [L107] SORT_3 init_60_arg_1 = var_34; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_69_arg_1 = var_24; [L110] state_68 = init_69_arg_1 [L111] SORT_3 init_73_arg_1 = var_34; [L112] state_72 = init_73_arg_1 [L113] SORT_3 init_77_arg_1 = var_34; [L114] state_76 = init_77_arg_1 [L115] SORT_3 init_81_arg_1 = var_34; [L116] state_80 = init_81_arg_1 [L117] SORT_6 init_91_arg_1 = var_89; [L118] state_90 = init_91_arg_1 [L119] SORT_6 init_93_arg_1 = var_89; [L120] state_92 = init_93_arg_1 [L121] SORT_6 init_97_arg_1 = var_89; [L122] state_96 = init_97_arg_1 [L123] SORT_1 init_116_arg_1 = var_24; [L124] state_115 = init_116_arg_1 [L125] SORT_3 init_118_arg_1 = var_34; [L126] state_117 = init_118_arg_1 [L127] SORT_3 init_122_arg_1 = var_34; [L128] state_121 = init_122_arg_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_119 = __VERIFIER_nondet_uchar() [L159] input_123 = __VERIFIER_nondet_uchar() [L160] input_125 = __VERIFIER_nondet_uchar() [L161] input_127 = __VERIFIER_nondet_uchar() [L162] input_130 = __VERIFIER_nondet_uchar() [L163] input_132 = __VERIFIER_nondet_uchar() [L164] input_135 = __VERIFIER_nondet_uint() [L165] input_137 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_27_arg_0 = state_25; [L169] SORT_3 var_27 = var_27_arg_0 >> 5; [L170] var_27 = var_27 & mask_SORT_3 [L171] SORT_3 var_67_arg_0 = var_27; [L172] SORT_3 var_67_arg_1 = var_28; [L173] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L174] SORT_1 var_70_arg_0 = state_25; [L175] SORT_1 var_70_arg_1 = state_68; [L176] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L177] SORT_3 var_71_arg_0 = var_67; [L178] SORT_3 var_71_arg_1 = var_70; [L179] SORT_3 var_71 = var_71_arg_0 & var_71_arg_1; [L180] SORT_3 var_74_arg_0 = state_72; [L181] SORT_3 var_74_arg_1 = var_28; [L182] SORT_3 var_74 = var_74_arg_0 != var_74_arg_1; [L183] SORT_3 var_75_arg_0 = var_71; [L184] SORT_3 var_75_arg_1 = var_74; [L185] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L186] SORT_3 var_78_arg_0 = state_76; [L187] SORT_3 var_78_arg_1 = var_28; [L188] SORT_3 var_78 = var_78_arg_0 == var_78_arg_1; [L189] SORT_3 var_79_arg_0 = var_75; [L190] SORT_3 var_79_arg_1 = var_78; [L191] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L192] SORT_3 var_82_arg_0 = state_80; [L193] SORT_3 var_82_arg_1 = var_28; [L194] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L195] SORT_3 var_83_arg_0 = var_79; [L196] SORT_3 var_83_arg_1 = var_82; [L197] SORT_3 var_83 = var_83_arg_0 & var_83_arg_1; [L198] SORT_1 var_44_arg_0 = state_25; [L199] SORT_43 var_44 = var_44_arg_0 >> 0; [L200] var_44 = var_44 & mask_SORT_43 [L201] SORT_43 var_84_arg_0 = var_44; [L202] SORT_43 var_84_arg_1 = var_45; [L203] SORT_3 var_84 = var_84_arg_0 != var_84_arg_1; [L204] SORT_3 var_85_arg_0 = var_83; [L205] SORT_3 var_85_arg_1 = var_84; [L206] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L207] var_85 = var_85 & mask_SORT_3 [L208] SORT_3 var_50_arg_0 = var_27; [L209] SORT_3 var_50_arg_1 = var_28; [L210] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L211] SORT_1 var_53_arg_0 = state_25; [L212] SORT_1 var_53_arg_1 = state_51; [L213] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L214] SORT_3 var_54_arg_0 = var_50; [L215] SORT_3 var_54_arg_1 = var_53; [L216] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L217] SORT_3 var_57_arg_0 = state_55; [L218] SORT_3 var_57_arg_1 = var_28; [L219] SORT_3 var_57 = var_57_arg_0 == var_57_arg_1; [L220] SORT_3 var_58_arg_0 = var_54; [L221] SORT_3 var_58_arg_1 = var_57; [L222] SORT_3 var_58 = var_58_arg_0 & var_58_arg_1; [L223] SORT_3 var_61_arg_0 = state_59; [L224] SORT_3 var_61_arg_1 = var_28; [L225] SORT_3 var_61 = var_61_arg_0 == var_61_arg_1; [L226] SORT_3 var_62_arg_0 = var_58; [L227] SORT_3 var_62_arg_1 = var_61; [L228] SORT_3 var_62 = var_62_arg_0 & var_62_arg_1; [L229] SORT_43 var_63_arg_0 = var_44; [L230] SORT_43 var_63_arg_1 = var_45; [L231] SORT_3 var_63 = var_63_arg_0 != var_63_arg_1; [L232] SORT_3 var_64_arg_0 = var_62; [L233] SORT_3 var_64_arg_1 = var_63; [L234] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L235] var_64 = var_64 & mask_SORT_3 [L236] SORT_3 var_29_arg_0 = var_27; [L237] SORT_3 var_29_arg_1 = var_28; [L238] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L239] SORT_1 var_32_arg_0 = state_25; [L240] SORT_1 var_32_arg_1 = state_30; [L241] SORT_3 var_32 = var_32_arg_0 == var_32_arg_1; [L242] SORT_3 var_33_arg_0 = var_29; [L243] SORT_3 var_33_arg_1 = var_32; [L244] SORT_3 var_33 = var_33_arg_0 & var_33_arg_1; [L245] SORT_3 var_37_arg_0 = state_35; [L246] SORT_3 var_37_arg_1 = var_28; [L247] SORT_3 var_37 = var_37_arg_0 == var_37_arg_1; [L248] SORT_3 var_38_arg_0 = var_33; [L249] SORT_3 var_38_arg_1 = var_37; [L250] SORT_3 var_38 = var_38_arg_0 & var_38_arg_1; [L251] SORT_3 var_41_arg_0 = state_39; [L252] SORT_3 var_41_arg_1 = var_28; [L253] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L254] SORT_3 var_42_arg_0 = var_38; [L255] SORT_3 var_42_arg_1 = var_41; [L256] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L257] SORT_43 var_46_arg_0 = var_44; [L258] SORT_43 var_46_arg_1 = var_45; [L259] SORT_3 var_46 = var_46_arg_0 != var_46_arg_1; [L260] SORT_3 var_47_arg_0 = var_42; [L261] SORT_3 var_47_arg_1 = var_46; [L262] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L263] var_47 = var_47 & mask_SORT_3 [L264] SORT_3 var_48_arg_0 = var_47; [L265] SORT_21 var_48_arg_1 = var_23; [L266] SORT_21 var_48_arg_2 = var_22; [L267] SORT_21 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L268] SORT_3 var_65_arg_0 = var_64; [L269] SORT_21 var_65_arg_1 = var_49; [L270] SORT_21 var_65_arg_2 = var_48; [L271] SORT_21 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L272] SORT_3 var_86_arg_0 = var_85; [L273] SORT_21 var_86_arg_1 = var_66; [L274] SORT_21 var_86_arg_2 = var_65; [L275] SORT_21 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L276] var_86 = var_86 & mask_SORT_21 [L277] SORT_21 var_87_arg_0 = var_86; [L278] SORT_21 var_87_arg_1 = var_49; [L279] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L280] SORT_3 var_88_arg_0 = var_87; [L281] SORT_3 var_88 = ~var_88_arg_0; [L282] SORT_43 var_103_arg_0 = var_44; [L283] SORT_43 var_103_arg_1 = var_45; [L284] SORT_3 var_103 = var_103_arg_0 == var_103_arg_1; [L285] SORT_21 var_100_arg_0 = var_86; [L286] SORT_21 var_100_arg_1 = var_23; [L287] SORT_3 var_100 = var_100_arg_0 == var_100_arg_1; [L288] SORT_21 var_98_arg_0 = var_86; [L289] SORT_21 var_98_arg_1 = var_22; [L290] SORT_3 var_98 = var_98_arg_0 == var_98_arg_1; [L291] SORT_3 var_101_arg_0 = var_100; [L292] SORT_3 var_101_arg_1 = var_98; [L293] SORT_3 var_101 = var_101_arg_0 | var_101_arg_1; [L294] var_101 = var_101 & mask_SORT_3 [L295] SORT_3 var_99_arg_0 = var_98; [L296] SORT_6 var_99_arg_1 = var_89; [L297] SORT_6 var_99_arg_2 = state_96; [L298] SORT_6 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L299] SORT_21 var_94_arg_0 = var_86; [L300] SORT_21 var_94_arg_1 = var_49; [L301] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L302] SORT_3 var_95_arg_0 = var_94; [L303] SORT_6 var_95_arg_1 = state_92; [L304] SORT_6 var_95_arg_2 = state_90; [L305] SORT_6 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L306] SORT_3 var_102_arg_0 = var_101; [L307] SORT_6 var_102_arg_1 = var_99; [L308] SORT_6 var_102_arg_2 = var_95; [L309] SORT_6 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L310] SORT_3 var_104_arg_0 = var_103; [L311] SORT_6 var_104_arg_1 = var_89; [L312] SORT_6 var_104_arg_2 = var_102; [L313] SORT_6 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L314] SORT_6 var_105_arg_0 = var_104; [L315] SORT_1 var_105 = var_105_arg_0 >> 26; [L316] var_105 = var_105 & mask_SORT_1 [L317] SORT_6 var_106_arg_0 = state_90; [L318] SORT_1 var_106 = var_106_arg_0 >> 26; [L319] var_106 = var_106 & mask_SORT_1 [L320] SORT_1 var_107_arg_0 = var_105; [L321] SORT_1 var_107_arg_1 = var_106; [L322] SORT_3 var_107 = var_107_arg_0 == var_107_arg_1; [L323] SORT_3 var_108_arg_0 = var_88; [L324] SORT_3 var_108_arg_1 = var_107; [L325] SORT_3 var_108 = var_108_arg_0 | var_108_arg_1; [L326] SORT_3 var_109_arg_0 = var_108; [L327] SORT_3 var_109 = ~var_109_arg_0; [L328] SORT_3 var_112_arg_0 = var_109; [L329] SORT_3 var_112 = ~var_112_arg_0; [L330] SORT_3 var_113_arg_0 = var_28; [L331] SORT_3 var_113_arg_1 = var_112; [L332] SORT_3 var_113 = var_113_arg_0 & var_113_arg_1; [L333] var_113 = var_113 & mask_SORT_3 [L334] SORT_3 bad_114_arg_0 = var_113; [L335] CALL __VERIFIER_assert(!(bad_114_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-08 00:11:44,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE