./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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.adding.2.prop1-func-interl.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 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:15:32,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:15:33,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 06:15:33,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:15:33,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:15:33,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:15:33,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:15:33,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:15:33,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:15:33,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:15:33,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:15:33,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:15:33,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:15:33,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:15:33,080 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:15:33,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:15:33,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:15:33,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:15:33,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:15:33,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:15:33,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:15:33,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:33,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:33,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:15:33,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:15:33,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:15:33,086 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 -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2025-01-09 06:15:33,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:15:33,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:15:33,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:15:33,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:15:33,324 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:15:33,329 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.adding.2.prop1-func-interl.c [2025-01-09 06:15:34,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0dafe7e2/688a972300334f9094ad5f8c4a53145e/FLAG77357d714 [2025-01-09 06:15:34,794 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:15:34,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-01-09 06:15:34,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0dafe7e2/688a972300334f9094ad5f8c4a53145e/FLAG77357d714 [2025-01-09 06:15:35,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0dafe7e2/688a972300334f9094ad5f8c4a53145e [2025-01-09 06:15:35,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:15:35,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:15:35,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:15:35,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:15:35,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:15:35,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e5863a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35, skipping insertion in model container [2025-01-09 06:15:35,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:15:35,271 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.adding.2.prop1-func-interl.c[1173,1186] [2025-01-09 06:15:35,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:15:35,379 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:15:35,386 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.adding.2.prop1-func-interl.c[1173,1186] [2025-01-09 06:15:35,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:15:35,448 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:15:35,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35 WrapperNode [2025-01-09 06:15:35,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:15:35,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:15:35,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:15:35,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:15:35,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,594 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1644 [2025-01-09 06:15:35,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:15:35,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:15:35,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:15:35,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:15:35,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,770 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-01-09 06:15:35,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:15:35,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:15:35,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:15:35,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:15:35,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (1/1) ... [2025-01-09 06:15:35,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:35,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:15:35,992 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-01-09 06:15:35,996 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-01-09 06:15:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:15:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:15:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:15:36,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:15:36,159 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:15:36,160 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:15:37,714 INFO L? ?]: Removed 857 outVars from TransFormulas that were not future-live. [2025-01-09 06:15:37,715 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:15:37,739 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:15:37,743 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:15:37,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:15:37 BoogieIcfgContainer [2025-01-09 06:15:37,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:15:37,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:15:37,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:15:37,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:15:37,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:15:35" (1/3) ... [2025-01-09 06:15:37,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a54795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:15:37, skipping insertion in model container [2025-01-09 06:15:37,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:35" (2/3) ... [2025-01-09 06:15:37,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a54795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:15:37, skipping insertion in model container [2025-01-09 06:15:37,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:15:37" (3/3) ... [2025-01-09 06:15:37,752 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-01-09 06:15:37,762 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:15:37,764 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c that has 1 procedures, 597 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:15:37,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:15:37,834 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;@6965b783, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:15:37,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:15:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 597 states, 595 states have (on average 1.5025210084033613) internal successors, (894), 596 states have internal predecessors, (894), 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-01-09 06:15:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 06:15:37,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:37,846 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] [2025-01-09 06:15:37,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:37,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1368434867, now seen corresponding path program 1 times [2025-01-09 06:15:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:37,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307317662] [2025-01-09 06:15:37,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:37,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:37,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 06:15:37,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 06:15:37,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:37,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:38,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307317662] [2025-01-09 06:15:38,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307317662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:38,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:38,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:38,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297865334] [2025-01-09 06:15:38,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:38,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:38,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:38,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:38,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:38,353 INFO L87 Difference]: Start difference. First operand has 597 states, 595 states have (on average 1.5025210084033613) internal successors, (894), 596 states have internal predecessors, (894), 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 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-01-09 06:15:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:38,443 INFO L93 Difference]: Finished difference Result 1149 states and 1724 transitions. [2025-01-09 06:15:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:38,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2025-01-09 06:15:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:38,452 INFO L225 Difference]: With dead ends: 1149 [2025-01-09 06:15:38,452 INFO L226 Difference]: Without dead ends: 594 [2025-01-09 06:15:38,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:38,456 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 858 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:38,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1762 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-09 06:15:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-01-09 06:15:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.4991568296795952) internal successors, (889), 593 states have internal predecessors, (889), 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-01-09 06:15:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 889 transitions. [2025-01-09 06:15:38,500 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 889 transitions. Word has length 59 [2025-01-09 06:15:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:38,500 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 889 transitions. [2025-01-09 06:15:38,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-01-09 06:15:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 889 transitions. [2025-01-09 06:15:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 06:15:38,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:38,502 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] [2025-01-09 06:15:38,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:15:38,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:38,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1453492137, now seen corresponding path program 1 times [2025-01-09 06:15:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286744733] [2025-01-09 06:15:38,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:38,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:38,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 06:15:38,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 06:15:38,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:38,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:38,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:38,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286744733] [2025-01-09 06:15:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286744733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:38,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:38,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409214308] [2025-01-09 06:15:38,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:38,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:38,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:38,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:38,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:38,785 INFO L87 Difference]: Start difference. First operand 594 states and 889 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-01-09 06:15:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:38,815 INFO L93 Difference]: Finished difference Result 598 states and 893 transitions. [2025-01-09 06:15:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:38,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2025-01-09 06:15:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:38,818 INFO L225 Difference]: With dead ends: 598 [2025-01-09 06:15:38,818 INFO L226 Difference]: Without dead ends: 596 [2025-01-09 06:15:38,818 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-01-09 06:15:38,819 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:38,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2655 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-01-09 06:15:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-01-09 06:15:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.4974789915966387) internal successors, (891), 595 states have internal predecessors, (891), 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-01-09 06:15:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 891 transitions. [2025-01-09 06:15:38,866 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 891 transitions. Word has length 60 [2025-01-09 06:15:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:38,867 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 891 transitions. [2025-01-09 06:15:38,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-01-09 06:15:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 891 transitions. [2025-01-09 06:15:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 06:15:38,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:38,868 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] [2025-01-09 06:15:38,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:15:38,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:38,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2110278823, now seen corresponding path program 1 times [2025-01-09 06:15:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:38,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577228835] [2025-01-09 06:15:38,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:38,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 06:15:38,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 06:15:38,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:38,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577228835] [2025-01-09 06:15:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577228835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:39,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:39,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805970169] [2025-01-09 06:15:39,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:39,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:39,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:39,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:39,114 INFO L87 Difference]: Start difference. First operand 596 states and 891 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-01-09 06:15:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:39,159 INFO L93 Difference]: Finished difference Result 1152 states and 1723 transitions. [2025-01-09 06:15:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:39,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2025-01-09 06:15:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:39,162 INFO L225 Difference]: With dead ends: 1152 [2025-01-09 06:15:39,162 INFO L226 Difference]: Without dead ends: 598 [2025-01-09 06:15:39,163 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-01-09 06:15:39,166 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:39,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2651 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:39,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-09 06:15:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-01-09 06:15:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4958123953098827) internal successors, (893), 597 states have internal predecessors, (893), 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-01-09 06:15:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 893 transitions. [2025-01-09 06:15:39,198 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 893 transitions. Word has length 61 [2025-01-09 06:15:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:39,199 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 893 transitions. [2025-01-09 06:15:39,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-01-09 06:15:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 893 transitions. [2025-01-09 06:15:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:15:39,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:39,200 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] [2025-01-09 06:15:39,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:15:39,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:39,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:39,200 INFO L85 PathProgramCache]: Analyzing trace with hash -103831486, now seen corresponding path program 1 times [2025-01-09 06:15:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:39,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781564737] [2025-01-09 06:15:39,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:39,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:39,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:15:39,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:15:39,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:39,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:39,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781564737] [2025-01-09 06:15:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781564737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:39,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262048750] [2025-01-09 06:15:39,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:39,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:39,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:39,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:39,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:39,371 INFO L87 Difference]: Start difference. First operand 598 states and 893 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:15:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:39,412 INFO L93 Difference]: Finished difference Result 1156 states and 1727 transitions. [2025-01-09 06:15:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:39,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-01-09 06:15:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:39,416 INFO L225 Difference]: With dead ends: 1156 [2025-01-09 06:15:39,417 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 06:15:39,417 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-01-09 06:15:39,418 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:39,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2645 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 06:15:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-01-09 06:15:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4941569282136895) internal successors, (895), 599 states have internal predecessors, (895), 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-01-09 06:15:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 895 transitions. [2025-01-09 06:15:39,435 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 895 transitions. Word has length 62 [2025-01-09 06:15:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:39,436 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 895 transitions. [2025-01-09 06:15:39,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:15:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 895 transitions. [2025-01-09 06:15:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:15:39,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:39,439 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] [2025-01-09 06:15:39,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:15:39,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:39,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:39,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1985078414, now seen corresponding path program 1 times [2025-01-09 06:15:39,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:39,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480208409] [2025-01-09 06:15:39,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:39,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:39,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:15:39,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:15:39,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:39,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:39,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480208409] [2025-01-09 06:15:39,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480208409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:39,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:39,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:15:39,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448041595] [2025-01-09 06:15:39,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:39,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:15:39,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:39,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:15:39,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:39,667 INFO L87 Difference]: Start difference. First operand 600 states and 895 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-01-09 06:15:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:39,759 INFO L93 Difference]: Finished difference Result 1162 states and 1734 transitions. [2025-01-09 06:15:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:15:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2025-01-09 06:15:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:39,761 INFO L225 Difference]: With dead ends: 1162 [2025-01-09 06:15:39,761 INFO L226 Difference]: Without dead ends: 604 [2025-01-09 06:15:39,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:39,765 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 4 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:39,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3515 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-01-09 06:15:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2025-01-09 06:15:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.4925124792013311) internal successors, (897), 601 states have internal predecessors, (897), 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-01-09 06:15:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 897 transitions. [2025-01-09 06:15:39,775 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 897 transitions. Word has length 63 [2025-01-09 06:15:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:39,776 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 897 transitions. [2025-01-09 06:15:39,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-01-09 06:15:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 897 transitions. [2025-01-09 06:15:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:15:39,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:39,777 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] [2025-01-09 06:15:39,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:15:39,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:39,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1793926481, now seen corresponding path program 1 times [2025-01-09 06:15:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:39,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112107922] [2025-01-09 06:15:39,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:39,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:39,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:15:39,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:15:39,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:39,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:39,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:39,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112107922] [2025-01-09 06:15:39,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112107922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:39,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:39,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:15:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205855133] [2025-01-09 06:15:39,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:39,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:15:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:39,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:15:39,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:39,900 INFO L87 Difference]: Start difference. First operand 602 states and 897 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-01-09 06:15:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:39,929 INFO L93 Difference]: Finished difference Result 1189 states and 1772 transitions. [2025-01-09 06:15:39,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:15:39,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2025-01-09 06:15:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:39,931 INFO L225 Difference]: With dead ends: 1189 [2025-01-09 06:15:39,931 INFO L226 Difference]: Without dead ends: 629 [2025-01-09 06:15:39,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:39,933 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 64 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:39,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 3476 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-01-09 06:15:39,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2025-01-09 06:15:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4904458598726114) internal successors, (936), 628 states have internal predecessors, (936), 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-01-09 06:15:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 936 transitions. [2025-01-09 06:15:39,943 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 936 transitions. Word has length 64 [2025-01-09 06:15:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:39,943 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 936 transitions. [2025-01-09 06:15:39,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-01-09 06:15:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 936 transitions. [2025-01-09 06:15:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:15:39,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:39,944 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] [2025-01-09 06:15:39,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:15:39,944 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:39,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1882603606, now seen corresponding path program 1 times [2025-01-09 06:15:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:39,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400151000] [2025-01-09 06:15:39,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:39,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:15:39,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:15:39,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:39,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:40,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:40,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400151000] [2025-01-09 06:15:40,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400151000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:40,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:40,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:15:40,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478982607] [2025-01-09 06:15:40,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:40,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:15:40,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:40,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:15:40,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:15:40,256 INFO L87 Difference]: Start difference. First operand 629 states and 936 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-01-09 06:15:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:40,413 INFO L93 Difference]: Finished difference Result 1196 states and 1785 transitions. [2025-01-09 06:15:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:15:40,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 64 [2025-01-09 06:15:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:40,415 INFO L225 Difference]: With dead ends: 1196 [2025-01-09 06:15:40,415 INFO L226 Difference]: Without dead ends: 636 [2025-01-09 06:15:40,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:15:40,417 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 863 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:40,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 3339 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-09 06:15:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2025-01-09 06:15:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4873417721518987) internal successors, (940), 632 states have internal predecessors, (940), 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-01-09 06:15:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 940 transitions. [2025-01-09 06:15:40,429 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 940 transitions. Word has length 64 [2025-01-09 06:15:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:40,429 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 940 transitions. [2025-01-09 06:15:40,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-01-09 06:15:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 940 transitions. [2025-01-09 06:15:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:15:40,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:40,430 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] [2025-01-09 06:15:40,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:15:40,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:40,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash -353009811, now seen corresponding path program 1 times [2025-01-09 06:15:40,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:40,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630070025] [2025-01-09 06:15:40,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:40,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:40,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:15:40,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:15:40,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:40,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630070025] [2025-01-09 06:15:40,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630070025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:40,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307428396] [2025-01-09 06:15:40,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:40,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:40,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:40,571 INFO L87 Difference]: Start difference. First operand 633 states and 940 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 06:15:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:40,652 INFO L93 Difference]: Finished difference Result 1203 states and 1789 transitions. [2025-01-09 06:15:40,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:40,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-01-09 06:15:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:40,654 INFO L225 Difference]: With dead ends: 1203 [2025-01-09 06:15:40,654 INFO L226 Difference]: Without dead ends: 636 [2025-01-09 06:15:40,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:40,655 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 847 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:40,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1690 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-09 06:15:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2025-01-09 06:15:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.48503937007874) internal successors, (943), 635 states have internal predecessors, (943), 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-01-09 06:15:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 943 transitions. [2025-01-09 06:15:40,688 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 943 transitions. Word has length 65 [2025-01-09 06:15:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:40,688 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 943 transitions. [2025-01-09 06:15:40,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 06:15:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 943 transitions. [2025-01-09 06:15:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:15:40,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:40,691 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] [2025-01-09 06:15:40,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:15:40,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:40,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1064191121, now seen corresponding path program 1 times [2025-01-09 06:15:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:40,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476312659] [2025-01-09 06:15:40,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:40,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:40,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:15:40,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:15:40,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:40,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:40,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:40,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476312659] [2025-01-09 06:15:40,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476312659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:40,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:40,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69910127] [2025-01-09 06:15:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:40,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:40,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:40,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:40,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:40,803 INFO L87 Difference]: Start difference. First operand 636 states and 943 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 06:15:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:40,830 INFO L93 Difference]: Finished difference Result 1202 states and 1784 transitions. [2025-01-09 06:15:40,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:40,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-01-09 06:15:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:40,832 INFO L225 Difference]: With dead ends: 1202 [2025-01-09 06:15:40,832 INFO L226 Difference]: Without dead ends: 635 [2025-01-09 06:15:40,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:40,834 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 844 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:40,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1749 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-01-09 06:15:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2025-01-09 06:15:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4842271293375395) internal successors, (941), 634 states have internal predecessors, (941), 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-01-09 06:15:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 941 transitions. [2025-01-09 06:15:40,844 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 941 transitions. Word has length 65 [2025-01-09 06:15:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:40,845 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 941 transitions. [2025-01-09 06:15:40,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 06:15:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 941 transitions. [2025-01-09 06:15:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:15:40,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:40,845 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] [2025-01-09 06:15:40,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:15:40,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:40,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash 348639918, now seen corresponding path program 1 times [2025-01-09 06:15:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017265772] [2025-01-09 06:15:40,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:40,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:15:40,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:15:40,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:40,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:41,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:41,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017265772] [2025-01-09 06:15:41,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017265772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:41,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:41,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:15:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958822196] [2025-01-09 06:15:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:41,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:15:41,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:41,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:15:41,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:15:41,058 INFO L87 Difference]: Start difference. First operand 635 states and 941 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-01-09 06:15:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:41,149 INFO L93 Difference]: Finished difference Result 1205 states and 1787 transitions. [2025-01-09 06:15:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:15:41,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 66 [2025-01-09 06:15:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:41,152 INFO L225 Difference]: With dead ends: 1205 [2025-01-09 06:15:41,152 INFO L226 Difference]: Without dead ends: 639 [2025-01-09 06:15:41,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:15:41,153 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 9 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:41,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4305 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-01-09 06:15:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 636. [2025-01-09 06:15:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.4834645669291338) internal successors, (942), 635 states have internal predecessors, (942), 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-01-09 06:15:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 942 transitions. [2025-01-09 06:15:41,164 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 942 transitions. Word has length 66 [2025-01-09 06:15:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:41,165 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 942 transitions. [2025-01-09 06:15:41,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-01-09 06:15:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 942 transitions. [2025-01-09 06:15:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:15:41,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:41,165 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] [2025-01-09 06:15:41,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:15:41,166 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:41,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:41,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1969752466, now seen corresponding path program 1 times [2025-01-09 06:15:41,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:41,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502370421] [2025-01-09 06:15:41,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:41,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:41,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:15:41,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:15:41,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:41,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:41,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:41,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502370421] [2025-01-09 06:15:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502370421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:41,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:15:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370073289] [2025-01-09 06:15:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:41,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:15:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:41,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:15:41,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:15:41,620 INFO L87 Difference]: Start difference. First operand 636 states and 942 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-01-09 06:15:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:41,961 INFO L93 Difference]: Finished difference Result 1214 states and 1798 transitions. [2025-01-09 06:15:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:15:41,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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 66 [2025-01-09 06:15:41,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:41,966 INFO L225 Difference]: With dead ends: 1214 [2025-01-09 06:15:41,966 INFO L226 Difference]: Without dead ends: 647 [2025-01-09 06:15:41,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 06:15:41,967 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 870 mSDsluCounter, 5084 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 5943 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:41,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 5943 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:15:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-01-09 06:15:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 643. [2025-01-09 06:15:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.4781931464174456) internal successors, (949), 642 states have internal predecessors, (949), 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-01-09 06:15:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 949 transitions. [2025-01-09 06:15:41,982 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 949 transitions. Word has length 66 [2025-01-09 06:15:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:41,982 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 949 transitions. [2025-01-09 06:15:41,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-01-09 06:15:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 949 transitions. [2025-01-09 06:15:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 06:15:41,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:41,983 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] [2025-01-09 06:15:41,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:15:41,984 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:41,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash 423924778, now seen corresponding path program 1 times [2025-01-09 06:15:41,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:41,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476737767] [2025-01-09 06:15:41,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:41,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:41,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 06:15:42,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 06:15:42,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:42,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:42,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:42,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476737767] [2025-01-09 06:15:42,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476737767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:42,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:42,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:15:42,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540891147] [2025-01-09 06:15:42,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:42,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:15:42,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:42,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:15:42,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:15:42,470 INFO L87 Difference]: Start difference. First operand 643 states and 949 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-01-09 06:15:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:42,667 INFO L93 Difference]: Finished difference Result 1227 states and 1811 transitions. [2025-01-09 06:15:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:15:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 67 [2025-01-09 06:15:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:42,670 INFO L225 Difference]: With dead ends: 1227 [2025-01-09 06:15:42,670 INFO L226 Difference]: Without dead ends: 653 [2025-01-09 06:15:42,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 06:15:42,671 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 870 mSDsluCounter, 5102 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 5968 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:42,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 5968 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:15:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-01-09 06:15:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 645. [2025-01-09 06:15:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.4782608695652173) internal successors, (952), 644 states have internal predecessors, (952), 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-01-09 06:15:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 952 transitions. [2025-01-09 06:15:42,682 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 952 transitions. Word has length 67 [2025-01-09 06:15:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:42,682 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 952 transitions. [2025-01-09 06:15:42,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-01-09 06:15:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 952 transitions. [2025-01-09 06:15:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:15:42,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:42,682 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] [2025-01-09 06:15:42,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:15:42,683 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:42,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash 565617738, now seen corresponding path program 1 times [2025-01-09 06:15:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:42,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947069426] [2025-01-09 06:15:42,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:42,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:42,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:15:42,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:15:42,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:42,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:42,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947069426] [2025-01-09 06:15:42,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947069426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:42,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:42,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:15:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563432822] [2025-01-09 06:15:42,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:42,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:15:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:42,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:15:42,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:15:42,905 INFO L87 Difference]: Start difference. First operand 645 states and 952 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-01-09 06:15:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:43,024 INFO L93 Difference]: Finished difference Result 1230 states and 1814 transitions. [2025-01-09 06:15:43,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:15:43,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-01-09 06:15:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:43,027 INFO L225 Difference]: With dead ends: 1230 [2025-01-09 06:15:43,027 INFO L226 Difference]: Without dead ends: 654 [2025-01-09 06:15:43,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:15:43,028 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 6 mSDsluCounter, 5138 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5998 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:43,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5998 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-01-09 06:15:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2025-01-09 06:15:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 1.4746543778801844) internal successors, (960), 651 states have internal predecessors, (960), 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-01-09 06:15:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 960 transitions. [2025-01-09 06:15:43,039 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 960 transitions. Word has length 68 [2025-01-09 06:15:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:43,039 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 960 transitions. [2025-01-09 06:15:43,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-01-09 06:15:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 960 transitions. [2025-01-09 06:15:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:15:43,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:43,040 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] [2025-01-09 06:15:43,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:15:43,040 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:43,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1988327780, now seen corresponding path program 1 times [2025-01-09 06:15:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:43,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129884098] [2025-01-09 06:15:43,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:43,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:43,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:15:43,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:15:43,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:43,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:43,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129884098] [2025-01-09 06:15:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129884098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:43,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:15:43,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189061239] [2025-01-09 06:15:43,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:43,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:15:43,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:43,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:15:43,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:43,179 INFO L87 Difference]: Start difference. First operand 652 states and 960 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-01-09 06:15:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:43,827 INFO L93 Difference]: Finished difference Result 1760 states and 2592 transitions. [2025-01-09 06:15:43,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:15:43,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2025-01-09 06:15:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:43,831 INFO L225 Difference]: With dead ends: 1760 [2025-01-09 06:15:43,831 INFO L226 Difference]: Without dead ends: 1177 [2025-01-09 06:15:43,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:15:43,833 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 797 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:43,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2569 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:15:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-01-09 06:15:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 702. [2025-01-09 06:15:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.4593437945791725) internal successors, (1023), 701 states have internal predecessors, (1023), 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-01-09 06:15:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1023 transitions. [2025-01-09 06:15:43,847 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1023 transitions. Word has length 68 [2025-01-09 06:15:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:43,847 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1023 transitions. [2025-01-09 06:15:43,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-01-09 06:15:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1023 transitions. [2025-01-09 06:15:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 06:15:43,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:43,848 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] [2025-01-09 06:15:43,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:15:43,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:43,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1189272367, now seen corresponding path program 1 times [2025-01-09 06:15:43,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:43,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986284418] [2025-01-09 06:15:43,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:43,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:43,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:15:43,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:15:43,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:43,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986284418] [2025-01-09 06:15:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986284418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:44,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:44,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:15:44,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510083754] [2025-01-09 06:15:44,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:44,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:15:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:44,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:15:44,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:15:44,167 INFO L87 Difference]: Start difference. First operand 702 states and 1023 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-01-09 06:15:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:44,237 INFO L93 Difference]: Finished difference Result 1296 states and 1896 transitions. [2025-01-09 06:15:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:15:44,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-01-09 06:15:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:44,240 INFO L225 Difference]: With dead ends: 1296 [2025-01-09 06:15:44,240 INFO L226 Difference]: Without dead ends: 713 [2025-01-09 06:15:44,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:15:44,241 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 835 mSDsluCounter, 3484 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 4362 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:44,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 4362 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-01-09 06:15:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 709. [2025-01-09 06:15:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.4576271186440677) internal successors, (1032), 708 states have internal predecessors, (1032), 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-01-09 06:15:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1032 transitions. [2025-01-09 06:15:44,252 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1032 transitions. Word has length 69 [2025-01-09 06:15:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:44,252 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1032 transitions. [2025-01-09 06:15:44,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-01-09 06:15:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1032 transitions. [2025-01-09 06:15:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 06:15:44,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:44,257 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] [2025-01-09 06:15:44,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:15:44,257 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:44,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash 977059328, now seen corresponding path program 1 times [2025-01-09 06:15:44,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:44,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627629849] [2025-01-09 06:15:44,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:44,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:44,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 06:15:44,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 06:15:44,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:44,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:44,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:44,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627629849] [2025-01-09 06:15:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627629849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:44,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:44,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 06:15:44,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315889562] [2025-01-09 06:15:44,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:44,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 06:15:44,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:44,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 06:15:44,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:15:44,535 INFO L87 Difference]: Start difference. First operand 709 states and 1032 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-01-09 06:15:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:44,838 INFO L93 Difference]: Finished difference Result 1331 states and 1949 transitions. [2025-01-09 06:15:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:15:44,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-01-09 06:15:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:44,841 INFO L225 Difference]: With dead ends: 1331 [2025-01-09 06:15:44,841 INFO L226 Difference]: Without dead ends: 725 [2025-01-09 06:15:44,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 06:15:44,842 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 845 mSDsluCounter, 4130 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:44,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 4965 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:15:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-01-09 06:15:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2025-01-09 06:15:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4530386740331491) internal successors, (1052), 724 states have internal predecessors, (1052), 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-01-09 06:15:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1052 transitions. [2025-01-09 06:15:44,857 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1052 transitions. Word has length 70 [2025-01-09 06:15:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:44,858 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1052 transitions. [2025-01-09 06:15:44,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-01-09 06:15:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1052 transitions. [2025-01-09 06:15:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:15:44,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:44,859 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] [2025-01-09 06:15:44,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:15:44,860 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:44,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1977496067, now seen corresponding path program 1 times [2025-01-09 06:15:44,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:44,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788975813] [2025-01-09 06:15:44,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:44,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 06:15:44,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 06:15:44,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:45,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:45,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788975813] [2025-01-09 06:15:45,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788975813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:45,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:45,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:15:45,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613328475] [2025-01-09 06:15:45,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:45,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:15:45,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:45,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:15:45,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:15:45,121 INFO L87 Difference]: Start difference. First operand 725 states and 1052 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-01-09 06:15:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:45,367 INFO L93 Difference]: Finished difference Result 1359 states and 1976 transitions. [2025-01-09 06:15:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:15:45,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 71 [2025-01-09 06:15:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:45,374 INFO L225 Difference]: With dead ends: 1359 [2025-01-09 06:15:45,374 INFO L226 Difference]: Without dead ends: 735 [2025-01-09 06:15:45,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 06:15:45,376 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 873 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:45,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 4978 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:15:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-01-09 06:15:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 728. [2025-01-09 06:15:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.4497936726272351) internal successors, (1054), 727 states have internal predecessors, (1054), 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-01-09 06:15:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1054 transitions. [2025-01-09 06:15:45,387 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1054 transitions. Word has length 71 [2025-01-09 06:15:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:45,387 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1054 transitions. [2025-01-09 06:15:45,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-01-09 06:15:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1054 transitions. [2025-01-09 06:15:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:15:45,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:45,387 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] [2025-01-09 06:15:45,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:15:45,388 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:45,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1277851670, now seen corresponding path program 1 times [2025-01-09 06:15:45,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:45,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927883795] [2025-01-09 06:15:45,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:45,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 06:15:45,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 06:15:45,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:45,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927883795] [2025-01-09 06:15:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927883795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:45,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:45,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:15:45,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417024576] [2025-01-09 06:15:45,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:45,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:15:45,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:45,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:15:45,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:15:45,570 INFO L87 Difference]: Start difference. First operand 728 states and 1054 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-01-09 06:15:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:45,697 INFO L93 Difference]: Finished difference Result 1344 states and 1956 transitions. [2025-01-09 06:15:45,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:15:45,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 71 [2025-01-09 06:15:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:45,700 INFO L225 Difference]: With dead ends: 1344 [2025-01-09 06:15:45,700 INFO L226 Difference]: Without dead ends: 735 [2025-01-09 06:15:45,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:15:45,701 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 5 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6010 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:45,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6010 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-01-09 06:15:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 718. [2025-01-09 06:15:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4560669456066946) internal successors, (1044), 717 states have internal predecessors, (1044), 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-01-09 06:15:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1044 transitions. [2025-01-09 06:15:45,711 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1044 transitions. Word has length 71 [2025-01-09 06:15:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:45,712 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1044 transitions. [2025-01-09 06:15:45,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-01-09 06:15:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1044 transitions. [2025-01-09 06:15:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:15:45,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:45,712 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] [2025-01-09 06:15:45,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:15:45,713 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:45,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash -668387598, now seen corresponding path program 1 times [2025-01-09 06:15:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:45,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586004541] [2025-01-09 06:15:45,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:45,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 06:15:45,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 06:15:45,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:45,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:45,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:45,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586004541] [2025-01-09 06:15:45,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586004541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:45,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:45,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:15:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845300744] [2025-01-09 06:15:45,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:45,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:15:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:45,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:15:45,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:15:45,971 INFO L87 Difference]: Start difference. First operand 718 states and 1044 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-01-09 06:15:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:46,172 INFO L93 Difference]: Finished difference Result 1323 states and 1932 transitions. [2025-01-09 06:15:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:15:46,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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 71 [2025-01-09 06:15:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:46,175 INFO L225 Difference]: With dead ends: 1323 [2025-01-09 06:15:46,175 INFO L226 Difference]: Without dead ends: 729 [2025-01-09 06:15:46,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:15:46,176 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 826 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 4206 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:46,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 4206 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:46,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-01-09 06:15:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 718. [2025-01-09 06:15:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4560669456066946) internal successors, (1044), 717 states have internal predecessors, (1044), 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-01-09 06:15:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1044 transitions. [2025-01-09 06:15:46,187 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1044 transitions. Word has length 71 [2025-01-09 06:15:46,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:46,187 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1044 transitions. [2025-01-09 06:15:46,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-01-09 06:15:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1044 transitions. [2025-01-09 06:15:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 06:15:46,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:46,189 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] [2025-01-09 06:15:46,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:15:46,189 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:46,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1572057892, now seen corresponding path program 1 times [2025-01-09 06:15:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:46,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719456332] [2025-01-09 06:15:46,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:46,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 06:15:46,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 06:15:46,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:46,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:46,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:46,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719456332] [2025-01-09 06:15:46,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719456332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:46,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:46,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:46,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135703404] [2025-01-09 06:15:46,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:46,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:46,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:46,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:46,328 INFO L87 Difference]: Start difference. First operand 718 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-01-09 06:15:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:46,399 INFO L93 Difference]: Finished difference Result 1329 states and 1941 transitions. [2025-01-09 06:15:46,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:46,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 72 [2025-01-09 06:15:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:46,402 INFO L225 Difference]: With dead ends: 1329 [2025-01-09 06:15:46,402 INFO L226 Difference]: Without dead ends: 718 [2025-01-09 06:15:46,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:46,403 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 879 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:46,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1680 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-01-09 06:15:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2025-01-09 06:15:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4532775453277544) internal successors, (1042), 717 states have internal predecessors, (1042), 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-01-09 06:15:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1042 transitions. [2025-01-09 06:15:46,414 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1042 transitions. Word has length 72 [2025-01-09 06:15:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:46,414 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1042 transitions. [2025-01-09 06:15:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-01-09 06:15:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1042 transitions. [2025-01-09 06:15:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 06:15:46,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:46,415 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] [2025-01-09 06:15:46,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:15:46,415 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:46,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:46,415 INFO L85 PathProgramCache]: Analyzing trace with hash 410843117, now seen corresponding path program 1 times [2025-01-09 06:15:46,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:46,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941794532] [2025-01-09 06:15:46,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:46,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:46,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 06:15:46,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 06:15:46,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:46,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:46,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:46,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941794532] [2025-01-09 06:15:46,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941794532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:46,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:46,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:15:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784117399] [2025-01-09 06:15:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:46,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:15:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:46,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:15:46,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:15:46,602 INFO L87 Difference]: Start difference. First operand 718 states and 1042 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-01-09 06:15:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:46,742 INFO L93 Difference]: Finished difference Result 1336 states and 1946 transitions. [2025-01-09 06:15:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:15:46,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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 73 [2025-01-09 06:15:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:46,745 INFO L225 Difference]: With dead ends: 1336 [2025-01-09 06:15:46,745 INFO L226 Difference]: Without dead ends: 716 [2025-01-09 06:15:46,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:15:46,746 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 1693 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:46,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 3332 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-09 06:15:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 715. [2025-01-09 06:15:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.4509803921568627) internal successors, (1036), 714 states have internal predecessors, (1036), 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-01-09 06:15:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1036 transitions. [2025-01-09 06:15:46,755 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1036 transitions. Word has length 73 [2025-01-09 06:15:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:46,755 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1036 transitions. [2025-01-09 06:15:46,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-01-09 06:15:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1036 transitions. [2025-01-09 06:15:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 06:15:46,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:46,756 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] [2025-01-09 06:15:46,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:15:46,756 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:46,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:46,757 INFO L85 PathProgramCache]: Analyzing trace with hash 228712370, now seen corresponding path program 1 times [2025-01-09 06:15:46,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:46,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462592415] [2025-01-09 06:15:46,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:46,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 06:15:46,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 06:15:46,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:46,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:46,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:46,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462592415] [2025-01-09 06:15:46,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462592415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:46,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:46,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:46,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49549080] [2025-01-09 06:15:46,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:46,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:46,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:46,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:46,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:46,836 INFO L87 Difference]: Start difference. First operand 715 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-01-09 06:15:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:46,895 INFO L93 Difference]: Finished difference Result 1319 states and 1921 transitions. [2025-01-09 06:15:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:46,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 73 [2025-01-09 06:15:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:46,898 INFO L225 Difference]: With dead ends: 1319 [2025-01-09 06:15:46,898 INFO L226 Difference]: Without dead ends: 717 [2025-01-09 06:15:46,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:46,900 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 826 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:46,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1697 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-01-09 06:15:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2025-01-09 06:15:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.453257790368272) internal successors, (1026), 706 states have internal predecessors, (1026), 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-01-09 06:15:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1026 transitions. [2025-01-09 06:15:46,910 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1026 transitions. Word has length 73 [2025-01-09 06:15:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:46,910 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1026 transitions. [2025-01-09 06:15:46,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-01-09 06:15:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1026 transitions. [2025-01-09 06:15:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 06:15:46,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:46,911 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] [2025-01-09 06:15:46,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:15:46,911 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:46,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash 420694957, now seen corresponding path program 1 times [2025-01-09 06:15:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:46,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780404516] [2025-01-09 06:15:46,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:46,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 06:15:46,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 06:15:46,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:46,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 06:15:46,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 06:15:46,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 06:15:46,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 06:15:46,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:46,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 06:15:46,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 06:15:46,993 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 06:15:46,994 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 06:15:46,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:15:46,997 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:15:47,048 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 06:15:47,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:15:47 BoogieIcfgContainer [2025-01-09 06:15:47,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 06:15:47,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 06:15:47,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 06:15:47,054 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 06:15:47,055 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:15:37" (3/4) ... [2025-01-09 06:15:47,056 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 06:15:47,057 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 06:15:47,057 INFO L158 Benchmark]: Toolchain (without parser) took 11924.34ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 103.8MB in the beginning and 180.1MB in the end (delta: -76.4MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2025-01-09 06:15:47,057 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:15:47,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.47ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 77.7MB in the end (delta: 26.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 06:15:47,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.85ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 38.0MB in the end (delta: 39.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 06:15:47,059 INFO L158 Benchmark]: Boogie Preprocessor took 355.32ms. Allocated memory is still 142.6MB. Free memory was 38.0MB in the beginning and 69.9MB in the end (delta: -31.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2025-01-09 06:15:47,059 INFO L158 Benchmark]: RCFGBuilder took 1791.62ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 69.9MB in the beginning and 66.4MB in the end (delta: 3.5MB). Peak memory consumption was 132.5MB. Max. memory is 16.1GB. [2025-01-09 06:15:47,059 INFO L158 Benchmark]: TraceAbstraction took 9307.63ms. Allocated memory was 251.7MB in the beginning and 352.3MB in the end (delta: 100.7MB). Free memory was 65.8MB in the beginning and 180.2MB in the end (delta: -114.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:15:47,059 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 352.3MB. Free memory was 180.2MB in the beginning and 180.1MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:15:47,060 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.39ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.47ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 77.7MB in the end (delta: 26.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.85ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 38.0MB in the end (delta: 39.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 355.32ms. Allocated memory is still 142.6MB. Free memory was 38.0MB in the beginning and 69.9MB in the end (delta: -31.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1791.62ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 69.9MB in the beginning and 66.4MB in the end (delta: 3.5MB). Peak memory consumption was 132.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9307.63ms. Allocated memory was 251.7MB in the beginning and 352.3MB in the end (delta: 100.7MB). Free memory was 65.8MB in the beginning and 180.2MB in the end (delta: -114.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 352.3MB. Free memory was 180.2MB in the beginning and 180.1MB in the end (delta: 46.8kB). There was no memory consumed. 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 shiftRight at line 109, overapproximation of bitwiseAnd at line 110, overapproximation of bitwiseAnd at line 107, overapproximation of bitwiseAnd at line 111, overapproximation of bitwiseAnd at line 116. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 500; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 200; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [input_37=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_79=200] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_79=200] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR var_33_arg_0 | ~mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=200] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=200] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_79=200] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=200] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=200] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_34=1, var_35_arg_0=-1, var_79=200] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_34=1, var_79=200] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_35_arg_0=1, var_35_arg_1=1, var_79=200] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_79=200] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_79=200] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 597 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12814 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12814 mSDsluCounter, 79495 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60715 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3405 IncrementalHoareTripleChecker+Invalid, 3428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 18780 mSDtfsCounter, 3405 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=17, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 547 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1446 ConstructedInterpolants, 0 QuantifiedInterpolants, 4939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-01-09 06:15:47,087 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 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.adding.2.prop1-func-interl.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 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:15:49,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:15:49,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 06:15:49,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:15:49,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:15:49,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:15:49,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:15:49,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:15:49,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:15:49,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:15:49,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:15:49,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:15:49,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:15:49,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:15:49,622 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:15:49,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:15:49,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:15:49,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:15:49,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:15:49,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:15:49,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:15:49,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 06:15:49,623 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 06:15:49,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 06:15:49,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:15:49,623 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:15:49,623 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:15:49,623 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:15:49,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:15:49,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:15:49,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:15:49,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:49,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:15:49,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:15:49,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:15:49,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:15:49,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:49,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:15:49,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:15:49,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:15:49,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:15:49,625 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 06:15:49,625 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 06:15:49,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:15:49,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:15:49,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:15:49,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:15:49,625 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 -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2025-01-09 06:15:49,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:15:49,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:15:49,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:15:49,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:15:49,917 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:15:49,918 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.adding.2.prop1-func-interl.c [2025-01-09 06:15:51,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/491599c87/f36a4536d6e24c0aa66cec71a6de3b06/FLAG0eaef959d [2025-01-09 06:15:51,494 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:15:51,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-01-09 06:15:51,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/491599c87/f36a4536d6e24c0aa66cec71a6de3b06/FLAG0eaef959d [2025-01-09 06:15:51,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/491599c87/f36a4536d6e24c0aa66cec71a6de3b06 [2025-01-09 06:15:51,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:15:51,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:15:51,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:15:51,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:15:51,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:15:51,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@351cab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51, skipping insertion in model container [2025-01-09 06:15:51,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:15:51,672 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.adding.2.prop1-func-interl.c[1173,1186] [2025-01-09 06:15:51,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:15:51,774 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:15:51,784 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.adding.2.prop1-func-interl.c[1173,1186] [2025-01-09 06:15:51,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:15:51,837 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:15:51,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51 WrapperNode [2025-01-09 06:15:51,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:15:51,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:15:51,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:15:51,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:15:51,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,879 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 452 [2025-01-09 06:15:51,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:15:51,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:15:51,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:15:51,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:15:51,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,920 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-01-09 06:15:51,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:15:51,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:15:51,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:15:51,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:15:51,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (1/1) ... [2025-01-09 06:15:51,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:51,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:15:51,964 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-01-09 06:15:51,966 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-01-09 06:15:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:15:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 06:15:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:15:51,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:15:52,098 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:15:52,099 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:15:52,474 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-01-09 06:15:52,474 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:15:52,480 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:15:52,480 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:15:52,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:15:52 BoogieIcfgContainer [2025-01-09 06:15:52,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:15:52,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:15:52,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:15:52,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:15:52,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:15:51" (1/3) ... [2025-01-09 06:15:52,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f2b1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:15:52, skipping insertion in model container [2025-01-09 06:15:52,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:51" (2/3) ... [2025-01-09 06:15:52,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f2b1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:15:52, skipping insertion in model container [2025-01-09 06:15:52,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:15:52" (3/3) ... [2025-01-09 06:15:52,488 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-01-09 06:15:52,498 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:15:52,499 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:15:52,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:15:52,544 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;@3875295b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:15:52,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:15:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-01-09 06:15:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 06:15:52,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:52,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 06:15:52,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:52,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 06:15:52,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 06:15:52,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517560660] [2025-01-09 06:15:52,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:52,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:15:52,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:15:52,572 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-01-09 06:15:52,574 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-01-09 06:15:52,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 06:15:52,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 06:15:52,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:52,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:52,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 06:15:52,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:15:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:52,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:15:52,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 06:15:52,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517560660] [2025-01-09 06:15:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517560660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:52,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413476066] [2025-01-09 06:15:52,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:52,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:52,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 06:15:53,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:53,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:53,008 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:15:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:53,054 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-01-09 06:15:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:53,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 06:15:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:53,059 INFO L225 Difference]: With dead ends: 17 [2025-01-09 06:15:53,059 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 06:15:53,061 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-01-09 06:15:53,062 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:53,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 06:15:53,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 06:15:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-01-09 06:15:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 06:15:53,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 06:15:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:53,080 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 06:15:53,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:15:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 06:15:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 06:15:53,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:53,080 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 06:15:53,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 06:15:53,285 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-01-09 06:15:53,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:53,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 06:15:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 06:15:53,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [780122977] [2025-01-09 06:15:53,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:53,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:15:53,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:15:53,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:15:53,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 06:15:53,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 06:15:53,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 06:15:53,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:53,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:53,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 06:15:53,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:16:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:16:07,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:16:15,798 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (let ((.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_37~0#1|)) (.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse18 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_38~0#1|))) (let ((.cse25 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|)) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse18))))))) (.cse23 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|)) (.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse2)))))))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse35)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse34))))) (and (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse21 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|))) (let ((.cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse21))))))) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse20))))))) (.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse0)))) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse16))))))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse14))))))) (.cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse20 .cse21))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 .cse19))))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse16 .cse17))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse14 .cse15))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse1 .cse2))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 (_ bv254 32)))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse5)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse5)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse10))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse11 .cse12)))))) .cse13)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 .cse15))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse2))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse4 .cse12))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse12))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23))))))))) .cse0))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse8))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse25))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse8)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse24 .cse25)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse22 .cse23)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse16 .cse12))))))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse3)))))))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 .cse29)))) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse14 .cse23))) .cse35))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse29)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse8))))))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse20))) .cse10))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse21 .cse25))) .cse34)))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse32 .cse33))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse30 .cse31))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse31))))))))) .cse0))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))))))))) .cse0)))))))))))))))) (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse44 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse54 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse50))))))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse54))))))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse46))))))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse44))))))) (.cse45 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse0)))) (.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse55 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse54 .cse55))))))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse52)))))))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse38 .cse39)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse50 .cse23))) .cse35))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse36 .cse37))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse37))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse39)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse49))))))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse45 .cse46))) .cse47))))) (let ((.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse44 .cse25))) .cse34)))) (.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse42 .cse43))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse40 .cse41))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse43))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 .cse41))))))))) .cse0)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse58 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse46 .cse44))))) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 .cse58))))) (let ((.cse56 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse54 .cse57))))) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse50 .cse56))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse50 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse54 .cse57))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse58))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse44)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse59 .cse2)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse53 .cse55))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse60 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 (_ bv255 32)))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse60))) .cse52))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 .cse60))) .cse48))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse45 .cse47)))))) .cse6))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse59 .cse2))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse61 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse51 .cse55))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse55))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse61 .cse23))))))))) .cse0))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse45 .cse49))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse62 .cse25))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse49)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse62 .cse25)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse61 .cse23))))))))))))))))))))))))))) .cse0))) (_ bv1 32)))))))))))) (let ((.cse63 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_38~0#1|))) (let ((.cse69 (not .cse63)) (.cse66 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse68 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse65 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse73 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_37~0#1|))) (and (or (and (or .cse63 (and (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse64 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse65))) .cse65))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse64))) (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse64) |c_ULTIMATE.start_main_~var_32~0#1|))))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse67 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse65))) .cse65))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand (bvor .cse66 (bvashr (bvor .cse67 .cse68) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse67))))))) (or .cse69 (let ((.cse71 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_29~0#1|))))) .cse65))) .cse65))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse70 (bvor .cse71 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse70))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse70) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse72 (bvor .cse71 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand (bvor .cse66 (bvashr (bvor .cse72 .cse68) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse72))))))))) (not .cse73)) (or (let ((.cse74 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse77 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse65))) .cse65))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvashr (bvand .cse77 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|))) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse77) (_ bv0 32))))))) (.cse75 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse76 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse65))) .cse65))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse66 (bvashr (bvor .cse76 .cse68) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse76) (_ bv0 32))))))) (and (or .cse69 .cse74) (or .cse63 .cse74) (or .cse75 .cse69) (or .cse63 .cse75))) .cse73))))) is different from false [2025-01-09 06:16:24,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 (_ bv255 32))))) (.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|))) (let ((.cse119 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse121 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse118 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse22 .cse10)))) (.cse74 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 (_ bv254 32))))) (.cse24 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|))) (let ((.cse3 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse249 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse242 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse230 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse232 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse236 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse238 ((_ zero_extend 24) .cse249))) (let ((.cse237 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse238))))))) (.cse241 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse236))))))) (.cse234 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse232))))))) (.cse233 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse230))))))) (.cse240 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse242))))))) (.cse231 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse235 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse239 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse243 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse224 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse241 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse242 .cse243))))))) (.cse225 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse238 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse239 .cse240)))))))) (let ((.cse222 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse236 .cse24))) .cse237)))) (.cse223 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse224 .cse225))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse222 .cse223))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse224 .cse225)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse226 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse234 .cse235))))))) (.cse227 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse231 .cse232))) .cse233))))) (let ((.cse228 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse230 .cse10))))))) (.cse229 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse226 .cse227))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse226 .cse227))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse228 .cse229))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse228 .cse229))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse222 .cse223)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse246 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse232 .cse230)))))))) (let ((.cse245 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse242 .cse246))))) (let ((.cse244 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse236 .cse245))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse244 .cse238))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse236 .cse245))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse242 .cse246))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse232 .cse230))) (_ bv0 32))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse244 .cse238))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse237 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse241 .cse243))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse234 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse235 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse231 .cse233))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse240 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse239 .cse74)))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse247 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse239 .cse243))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse239 .cse243))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse247 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse248 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse231 .cse235))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse248 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse231 .cse235)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse248 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse247 .cse24)))))))))))))))))))))))))))))) (_ bv1 32)))))) (_ bv0 8)) (= (_ bv0 8) .cse249))))) (.cse125 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse220 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse221 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse198 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse204 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse196 ((_ zero_extend 24) .cse221)) (.cse201 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse200 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse202 ((_ zero_extend 24) .cse220))) (let ((.cse208 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse202))))))) (.cse209 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse200))))))) (.cse195 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse194 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse210 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse201))))))) (.cse206 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse196))))))) (.cse190 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse211 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse204))))))) (.cse207 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse198))))))) (.cse191 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse192 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse190 .cse191))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse190 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse193 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse195))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse193 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse194 .cse195)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse193 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse192 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse203 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse200 .cse201))))) (let ((.cse205 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse202 .cse203))))) (let ((.cse199 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse204 .cse205))))) (let ((.cse197 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse198 .cse199))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse196 .cse197))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse198 .cse199))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse200 .cse201))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse202 .cse203)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse204 .cse205)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse206 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse207 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse208))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse209 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse195 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse210))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse211 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse190 .cse74))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse196 .cse197)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse218 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse207 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse204 .cse191))))))) (.cse219 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse196 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse190 .cse211)))))))) (let ((.cse216 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse198 .cse24))) .cse206)))) (.cse217 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse218 .cse219))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse214 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse200))) .cse210)))) (.cse215 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse202 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse209 .cse195)))))))) (let ((.cse212 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse214 .cse215)))) (.cse213 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse201 .cse10))) .cse208))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse212 .cse213))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse214 .cse215))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse212 .cse213))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse216 .cse217))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse218 .cse219))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse216 .cse217))))))))))))))))))))))))))))))))) (_ bv0 8)) (= (_ bv0 8) .cse220) (= (_ bv0 8) .cse221))))) (.cse1 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse189 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse119 (bvashr (bvor .cse189 .cse121) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse189) (_ bv0 32)))))) (.cse127 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse157 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse188 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) .cse157) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse176 ((_ zero_extend 24) .cse188)) (.cse164 ((_ zero_extend 24) .cse157)) (.cse162 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse168 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse180 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse174 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse179 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse174))))))) (.cse178 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse180))))))) (.cse165 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse168))))))) (.cse169 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse162))))))) (.cse163 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse164))))))) (.cse175 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse176))))))) (.cse167 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse166 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse177 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse181 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse172 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse179 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse180 .cse181))))))) (.cse173 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse176 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse177 .cse178)))))))) (let ((.cse170 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse174 .cse24))) .cse175)))) (.cse171 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse172 .cse173))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse160 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse167 .cse168))) .cse169)))) (.cse161 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse164 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse166)))))))) (let ((.cse158 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse160 .cse161)))) (.cse159 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse162 .cse10))) .cse163))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse158 .cse159))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse160 .cse161))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse158 .cse159))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse170 .cse171))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse172 .cse173))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse170 .cse171)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse184 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse168 .cse162))))) (let ((.cse185 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse164 .cse184))))) (let ((.cse183 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse180 .cse185))))) (let ((.cse182 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse174 .cse183))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse176 .cse182))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse174 .cse183))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse168 .cse162))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse164 .cse184)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse180 .cse185)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse176 .cse182))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse179 .cse181))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse177 .cse22))) .cse178))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse166 .cse22))) .cse165))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse167 .cse169)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse163)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse175 .cse24)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse186 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse177 .cse181))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse177 .cse181))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse186 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse187 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse167 .cse166))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse187 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse167 .cse166)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse187 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse186 .cse24)))))))))))))))))))))))))))))))))))) (= (_ bv0 8) .cse188))))) (.cse0 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse129 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) .cse129) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse146 ((_ zero_extend 24) .cse129)) (.cse138 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse140 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse150 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse144 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse149 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse144))))))) (.cse151 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse147 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse148 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse150))))))) (.cse143 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse142 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse140))))))) (.cse139 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse141 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse138))))))) (.cse145 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse146)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse132 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse149 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse150 .cse151))))))) (.cse133 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse146 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse147 .cse148)))))))) (let ((.cse130 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse144 .cse24))) .cse145)))) (.cse131 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse132 .cse133))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse130 .cse131))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse132 .cse133)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse134 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse142 .cse143))))))) (.cse135 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse140))) .cse141))))) (let ((.cse136 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse138 .cse10))))))) (.cse137 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse134 .cse135))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse134 .cse135))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse136 .cse137))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse136 .cse137))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse130 .cse131)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse152 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse147 .cse151))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse147 .cse151))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse152 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse153 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse143))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse153 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse139 .cse143)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse153 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse152 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse156 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse140 .cse138)))))))) (let ((.cse155 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse150 .cse156))))) (let ((.cse154 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse144 .cse155))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse149 .cse151))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse147 .cse22))) .cse148))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse143 .cse22))) .cse142))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse141)))))) .cse62))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse145 .cse24)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse154 .cse146)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse154 .cse146))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse144 .cse155))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse150 .cse156))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse140 .cse138))) (_ bv0 32))))))))))))))))))))))))))))))))))))))))))))) .cse4))) (_ bv1 32))))))))))) (.cse2 (forall ((|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))))) (.cse126 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse128 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvashr (bvand .cse128 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|))) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse128) (_ bv0 32)))))))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|)))))) (let ((.cse38 (let ((.cse123 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse118 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_6~0#1|) .cse118)))))))))) .cse118))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse122 (bvor .cse123 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse122) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse122)))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse124 (bvor .cse123 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse124)) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse119 (bvashr (bvor .cse121 .cse124) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)))))))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse22 .cse24)))) (.cse37 (and (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse117 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse117))) (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse117) |c_ULTIMATE.start_main_~var_32~0#1|))))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse120 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand (bvor .cse119 (bvashr (bvor .cse120 .cse121) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse120)))))))) (and (or (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse36 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse12 ((_ zero_extend 24) .cse36)) (.cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse23))))))) (.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse26))))))) (.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse16))))))) (.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse9))))))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse29))))))) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse27)))))))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 .cse19)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse16))) .cse17)))) (.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 .cse14)))))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse7 .cse8)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse10))) .cse11))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse6))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse8))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse6))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse20 .cse21)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 .cse27))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse14))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse31 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse14)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse30 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse16 .cse9))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse34))))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse35))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse32)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse22))) .cse29))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 .cse22))) .cse13))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse17)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse11)))))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse32))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse9))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse34)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse35)))))))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))))))))))))))))))))) .cse4))) (= (_ bv0 8) .cse36)))) .cse37) (or .cse38 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse47 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse49 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse55 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse53 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse54 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse53))))))) (.cse56 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse58 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse55))))))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse49))))))) (.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse47)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse58))))))) (.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse54 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse55 .cse56)))))))) (let ((.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse41 .cse42)))) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse53 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse39 .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse42))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse39 .cse40)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse52))))))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse49))) .cse50))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse47 .cse10))))))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse43 .cse44))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse43 .cse44))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse46))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse45 .cse46)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse57 .cse56))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse59 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse60 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse52))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse60 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse52)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse60 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse59 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse63 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse49 .cse47)))))))) (let ((.cse61 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse55 .cse63))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse53 .cse61))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse54 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse22))) .cse58))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse52 .cse22))) .cse51))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse50)))))) .cse62))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse53 .cse61))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse55 .cse63))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 .cse47))) (_ bv0 32)))))))))))))))))))))))))))))))))))))))))))) .cse4))) (_ bv1 32)))))))) .cse2) (or .cse38 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse77 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse70 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse79 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse80 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|))) (let ((.cse68 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse75 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse80))))))) (.cse73 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse79))))))) (.cse69 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse70))))))) (.cse65 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse77)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse66 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse64 .cse65))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse65))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse66 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse67 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse68 .cse69))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse67 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse68 .cse69)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse67 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse66 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse78 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse79 .cse80)))))))) (let ((.cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse77 .cse78))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse70 .cse71))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse72 .cse65))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse73 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse69 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse68 .cse75))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse74)))))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse70 .cse71))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 .cse78))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse79 .cse80))) (_ bv0 32))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse83 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse76))))))) (.cse84 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse77 .cse65)))))))) (let ((.cse81 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse83 .cse84)))) (.cse82 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse70 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse81 .cse82))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse83 .cse84))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse81 .cse82)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse85 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse73 .cse69))))))) (.cse86 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse68 .cse79))) .cse75))))) (let ((.cse87 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse80 .cse10))))))) (.cse88 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse85 .cse86))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse85 .cse86))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse87 .cse88))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse87 .cse88))))))))))))))))))))))))))))))))))))))))))) .cse2) (or (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse89 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) .cse89) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse108 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse94 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse100 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse96 ((_ zero_extend 24) .cse89)) (.cse106 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse107 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse106))))))) (.cse95 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse96))))))) (.cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse100))))))) (.cse101 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse94))))))) (.cse111 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse108))))))) (.cse99 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse98 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse110 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse109 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse102 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse111))))))) (.cse103 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse107 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse108 .cse109)))))))) (let ((.cse104 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse102 .cse103)))) (.cse105 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse106 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse92 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse99 .cse100))) .cse101)))) (.cse93 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse96 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse97 .cse98)))))))) (let ((.cse90 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse92 .cse93)))) (.cse91 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse94 .cse10))) .cse95))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse90 .cse91))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse92 .cse93))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse90 .cse91))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse102 .cse103))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse104 .cse105))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse104 .cse105)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse113 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse100 .cse94))))) (let ((.cse114 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse96 .cse113))))) (let ((.cse112 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse108 .cse114))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse106 .cse112))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse100 .cse94))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse96 .cse113)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse108 .cse114)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse107 .cse109))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse95))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse98 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse99 .cse101))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse111 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse74)))))))))))) .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse106 .cse112))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse115 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse110 .cse109))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse109))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse115 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse116 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse99 .cse98))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse116 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse99 .cse98)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse116 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse115 .cse24))))))))))))))))))))) .cse4)))))))))))))))))) .cse37)))) (or .cse1 .cse125) (or .cse3 .cse2 .cse126) (or .cse125 .cse126) (or .cse127 .cse126) (or .cse1 .cse127) (or .cse0 .cse2 .cse126)))))) is different from false [2025-01-09 06:16:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 06:16:25,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 06:16:25,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780122977] [2025-01-09 06:16:25,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780122977] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:16:25,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 06:16:25,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-01-09 06:16:25,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401570866] [2025-01-09 06:16:25,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 06:16:25,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 06:16:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 06:16:25,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 06:16:25,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=68, Unknown=3, NotChecked=34, Total=132 [2025-01-09 06:16:25,100 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:16:27,737 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-01-09 06:16:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 06:16:27,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=27, Invalid=68, Unknown=3, NotChecked=34, Total=132 [2025-01-09 06:16:27,739 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:16:27,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2025-01-09 06:16:27,742 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 101 [2025-01-09 06:16:27,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 06:16:27,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:16:27,940 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2025-01-09 06:16:27,946 INFO L158 Benchmark]: Toolchain (without parser) took 36417.85ms. Allocated memory was 117.4MB in the beginning and 469.8MB in the end (delta: 352.3MB). Free memory was 92.2MB in the beginning and 331.6MB in the end (delta: -239.5MB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB. [2025-01-09 06:16:27,946 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:16:27,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.30ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 70.2MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 06:16:27,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.85ms. Allocated memory is still 117.4MB. Free memory was 70.2MB in the beginning and 66.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:16:27,947 INFO L158 Benchmark]: Boogie Preprocessor took 58.42ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 61.7MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 06:16:27,947 INFO L158 Benchmark]: RCFGBuilder took 541.69ms. Allocated memory is still 117.4MB. Free memory was 61.7MB in the beginning and 53.9MB in the end (delta: 7.7MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2025-01-09 06:16:27,947 INFO L158 Benchmark]: TraceAbstraction took 35463.76ms. Allocated memory was 117.4MB in the beginning and 469.8MB in the end (delta: 352.3MB). Free memory was 53.2MB in the beginning and 331.6MB in the end (delta: -278.5MB). Peak memory consumption was 164.5MB. Max. memory is 16.1GB. [2025-01-09 06:16:27,948 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.24ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.30ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 70.2MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.85ms. Allocated memory is still 117.4MB. Free memory was 70.2MB in the beginning and 66.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.42ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 61.7MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 541.69ms. Allocated memory is still 117.4MB. Free memory was 61.7MB in the beginning and 53.9MB in the end (delta: 7.7MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * TraceAbstraction took 35463.76ms. Allocated memory was 117.4MB in the beginning and 469.8MB in the end (delta: 352.3MB). Free memory was 53.2MB in the beginning and 331.6MB in the end (delta: -278.5MB). Peak memory consumption was 164.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")