./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:43:50,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:43:50,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 07:43:50,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:43:50,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:43:50,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:43:50,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:43:50,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:43:50,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:43:50,825 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:43:50,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:43:50,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:43:50,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:43:50,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:43:50,827 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:43:50,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:43:50,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:43:50,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:43:50,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:43:50,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:43:50,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:43:50,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:43:50,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:43:50,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:43:50,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:43:50,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:43:50,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:43:50,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:43:50,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:43:50,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:43:50,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:43:50,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:43:50,829 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:43:50,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:43:50,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:43:50,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:43:50,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:43:50,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:43:50,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:43:50,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:43:50,830 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2025-03-08 07:43:51,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:43:51,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:43:51,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:43:51,057 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:43:51,057 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:43:51,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-08 07:43:52,181 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c442a74a1/cd9c01357a5d40c2b0d99a7a6cc11fbf/FLAG9c11f1996 [2025-03-08 07:43:52,447 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:43:52,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-08 07:43:52,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c442a74a1/cd9c01357a5d40c2b0d99a7a6cc11fbf/FLAG9c11f1996 [2025-03-08 07:43:52,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c442a74a1/cd9c01357a5d40c2b0d99a7a6cc11fbf [2025-03-08 07:43:52,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:43:52,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:43:52,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:43:52,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:43:52,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:43:52,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:52,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60592373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52, skipping insertion in model container [2025-03-08 07:43:52,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:52,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:43:52,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2025-03-08 07:43:52,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:43:52,754 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:43:52,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2025-03-08 07:43:52,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:43:52,830 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:43:52,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52 WrapperNode [2025-03-08 07:43:52,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:43:52,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:43:52,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:43:52,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:43:52,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:52,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:52,972 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1644 [2025-03-08 07:43:52,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:43:52,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:43:52,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:43:52,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:43:52,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:52,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:53,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:53,105 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:43:53,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:53,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:53,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:53,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:53,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:53,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:53,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:43:53,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:43:53,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:43:53,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:43:53,187 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (1/1) ... [2025-03-08 07:43:53,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:43:53,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:43:53,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:43:53,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:43:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:43:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:43:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:43:53,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:43:53,381 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:43:53,383 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:43:54,827 INFO L? ?]: Removed 857 outVars from TransFormulas that were not future-live. [2025-03-08 07:43:54,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:43:54,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:43:54,909 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-08 07:43:54,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:43:54 BoogieIcfgContainer [2025-03-08 07:43:54,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:43:54,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:43:54,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:43:54,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:43:54,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:43:52" (1/3) ... [2025-03-08 07:43:54,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59223d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:43:54, skipping insertion in model container [2025-03-08 07:43:54,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:43:52" (2/3) ... [2025-03-08 07:43:54,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59223d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:43:54, skipping insertion in model container [2025-03-08 07:43:54,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:43:54" (3/3) ... [2025-03-08 07:43:54,915 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-08 07:43:54,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:43:54,930 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-03-08 07:43:54,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:43:55,004 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;@575e4ae3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:43:55,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 07:43:55,011 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-03-08 07:43:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 07:43:55,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:55,017 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-03-08 07:43:55,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:55,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1240092212, now seen corresponding path program 1 times [2025-03-08 07:43:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:55,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458731043] [2025-03-08 07:43:55,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:55,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 07:43:55,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 07:43:55,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:55,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:55,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-03-08 07:43:55,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:55,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458731043] [2025-03-08 07:43:55,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458731043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:55,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:55,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:43:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343656543] [2025-03-08 07:43:55,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:55,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:43:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:55,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:43:55,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:43:55,494 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-03-08 07:43:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:55,797 INFO L93 Difference]: Finished difference Result 1149 states and 1724 transitions. [2025-03-08 07:43:55,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:43:55,799 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-03-08 07:43:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:55,807 INFO L225 Difference]: With dead ends: 1149 [2025-03-08 07:43:55,807 INFO L226 Difference]: Without dead ends: 594 [2025-03-08 07:43:55,812 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-03-08 07:43:55,813 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 858 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:55,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1470 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:43:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-08 07:43:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-08 07:43:55,860 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-03-08 07:43:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 889 transitions. [2025-03-08 07:43:55,866 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 889 transitions. Word has length 59 [2025-03-08 07:43:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:55,866 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 889 transitions. [2025-03-08 07:43:55,866 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-03-08 07:43:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 889 transitions. [2025-03-08 07:43:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 07:43:55,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:55,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] [2025-03-08 07:43:55,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:43:55,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:55,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2124501296, now seen corresponding path program 1 times [2025-03-08 07:43:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:55,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397021478] [2025-03-08 07:43:55,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:55,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 07:43:55,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 07:43:55,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:55,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:56,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397021478] [2025-03-08 07:43:56,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397021478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:56,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:56,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:43:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934260491] [2025-03-08 07:43:56,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:56,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:43:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:56,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:43:56,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:43:56,074 INFO L87 Difference]: Start difference. First operand 594 states and 889 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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-03-08 07:43:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:56,290 INFO L93 Difference]: Finished difference Result 1147 states and 1718 transitions. [2025-03-08 07:43:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:43:56,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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-03-08 07:43:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:56,293 INFO L225 Difference]: With dead ends: 1147 [2025-03-08 07:43:56,295 INFO L226 Difference]: Without dead ends: 595 [2025-03-08 07:43:56,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:43:56,296 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:56,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1477 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:43:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-08 07:43:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-03-08 07:43:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4983164983164983) internal successors, (890), 594 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:43:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 890 transitions. [2025-03-08 07:43:56,309 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 890 transitions. Word has length 60 [2025-03-08 07:43:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:56,310 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 890 transitions. [2025-03-08 07:43:56,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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-03-08 07:43:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 890 transitions. [2025-03-08 07:43:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 07:43:56,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:56,311 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-03-08 07:43:56,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:43:56,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:56,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash -521276463, now seen corresponding path program 1 times [2025-03-08 07:43:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813276686] [2025-03-08 07:43:56,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:56,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 07:43:56,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 07:43:56,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:56,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:56,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813276686] [2025-03-08 07:43:56,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813276686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:56,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:56,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:43:56,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821462004] [2025-03-08 07:43:56,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:56,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:43:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:56,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:43:56,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:43:56,579 INFO L87 Difference]: Start difference. First operand 595 states and 890 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-03-08 07:43:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:56,848 INFO L93 Difference]: Finished difference Result 599 states and 894 transitions. [2025-03-08 07:43:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:43:56,849 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-03-08 07:43:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:56,851 INFO L225 Difference]: With dead ends: 599 [2025-03-08 07:43:56,851 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 07:43:56,851 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-03-08 07:43:56,852 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 0 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:56,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2215 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:43:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 07:43:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-08 07:43:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.4966442953020134) internal successors, (892), 596 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:43:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 892 transitions. [2025-03-08 07:43:56,863 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 892 transitions. Word has length 60 [2025-03-08 07:43:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:56,863 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 892 transitions. [2025-03-08 07:43:56,864 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-03-08 07:43:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 892 transitions. [2025-03-08 07:43:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 07:43:56,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:56,865 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-03-08 07:43:56,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:43:56,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:56,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1024978802, now seen corresponding path program 1 times [2025-03-08 07:43:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:56,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805718728] [2025-03-08 07:43:56,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:56,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 07:43:56,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 07:43:56,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:56,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:57,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:57,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805718728] [2025-03-08 07:43:57,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805718728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:57,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:57,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:43:57,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611792576] [2025-03-08 07:43:57,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:57,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:43:57,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:57,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:43:57,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:43:57,042 INFO L87 Difference]: Start difference. First operand 597 states and 892 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-03-08 07:43:57,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:57,298 INFO L93 Difference]: Finished difference Result 1154 states and 1725 transitions. [2025-03-08 07:43:57,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:43:57,298 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-03-08 07:43:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:57,301 INFO L225 Difference]: With dead ends: 1154 [2025-03-08 07:43:57,301 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 07:43:57,301 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-03-08 07:43:57,302 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 0 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:57,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2212 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:43:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 07:43:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-08 07:43:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.4949832775919731) internal successors, (894), 598 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-03-08 07:43:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 894 transitions. [2025-03-08 07:43:57,316 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 894 transitions. Word has length 61 [2025-03-08 07:43:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:57,317 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 894 transitions. [2025-03-08 07:43:57,317 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-03-08 07:43:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 894 transitions. [2025-03-08 07:43:57,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:43:57,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:57,321 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-03-08 07:43:57,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:43:57,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:57,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -653885460, now seen corresponding path program 1 times [2025-03-08 07:43:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:57,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429894465] [2025-03-08 07:43:57,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:57,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:43:57,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:43:57,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:57,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429894465] [2025-03-08 07:43:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429894465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:57,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:57,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:43:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126144732] [2025-03-08 07:43:57,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:57,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:43:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:57,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:43:57,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:43:57,461 INFO L87 Difference]: Start difference. First operand 599 states and 894 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-03-08 07:43:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:57,710 INFO L93 Difference]: Finished difference Result 1158 states and 1729 transitions. [2025-03-08 07:43:57,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:43:57,710 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-03-08 07:43:57,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:57,714 INFO L225 Difference]: With dead ends: 1158 [2025-03-08 07:43:57,714 INFO L226 Difference]: Without dead ends: 601 [2025-03-08 07:43:57,715 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-03-08 07:43:57,715 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 0 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:57,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2207 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:43:57,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-08 07:43:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-08 07:43:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.4933333333333334) internal successors, (896), 600 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:43:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 896 transitions. [2025-03-08 07:43:57,732 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 896 transitions. Word has length 62 [2025-03-08 07:43:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:57,733 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 896 transitions. [2025-03-08 07:43:57,733 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-03-08 07:43:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 896 transitions. [2025-03-08 07:43:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:43:57,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:57,733 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-03-08 07:43:57,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:43:57,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:57,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1202216745, now seen corresponding path program 1 times [2025-03-08 07:43:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:57,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738008101] [2025-03-08 07:43:57,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:57,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:43:57,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:43:57,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:57,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:58,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738008101] [2025-03-08 07:43:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738008101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:58,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:58,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:43:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842766208] [2025-03-08 07:43:58,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:58,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:43:58,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:58,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:43:58,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:43:58,038 INFO L87 Difference]: Start difference. First operand 601 states and 896 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-03-08 07:43:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:58,537 INFO L93 Difference]: Finished difference Result 1168 states and 1741 transitions. [2025-03-08 07:43:58,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:43:58,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-03-08 07:43:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:58,539 INFO L225 Difference]: With dead ends: 1168 [2025-03-08 07:43:58,539 INFO L226 Difference]: Without dead ends: 609 [2025-03-08 07:43:58,540 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-03-08 07:43:58,541 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 849 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 3673 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:58,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 3673 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:43:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-08 07:43:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2025-03-08 07:43:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.4933774834437086) internal successors, (902), 604 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:43:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 902 transitions. [2025-03-08 07:43:58,551 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 902 transitions. Word has length 63 [2025-03-08 07:43:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:58,551 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 902 transitions. [2025-03-08 07:43:58,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-03-08 07:43:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 902 transitions. [2025-03-08 07:43:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:43:58,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:58,552 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-03-08 07:43:58,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:43:58,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:58,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:58,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2085784839, now seen corresponding path program 1 times [2025-03-08 07:43:58,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:58,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981129285] [2025-03-08 07:43:58,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:58,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:58,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:43:58,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:43:58,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:58,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:58,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:58,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981129285] [2025-03-08 07:43:58,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981129285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:58,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:58,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:43:58,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156558162] [2025-03-08 07:43:58,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:58,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:43:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:58,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:43:58,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:43:58,732 INFO L87 Difference]: Start difference. First operand 605 states and 902 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-03-08 07:43:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:59,079 INFO L93 Difference]: Finished difference Result 1172 states and 1748 transitions. [2025-03-08 07:43:59,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:43:59,079 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-03-08 07:43:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:59,081 INFO L225 Difference]: With dead ends: 1172 [2025-03-08 07:43:59,081 INFO L226 Difference]: Without dead ends: 609 [2025-03-08 07:43:59,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:43:59,082 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 4 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:59,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2935 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:43:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-08 07:43:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 607. [2025-03-08 07:43:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 1.4917491749174918) internal successors, (904), 606 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:43:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 904 transitions. [2025-03-08 07:43:59,093 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 904 transitions. Word has length 64 [2025-03-08 07:43:59,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:59,094 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 904 transitions. [2025-03-08 07:43:59,094 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-03-08 07:43:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 904 transitions. [2025-03-08 07:43:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:43:59,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:59,095 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-03-08 07:43:59,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:43:59,095 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:59,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:59,095 INFO L85 PathProgramCache]: Analyzing trace with hash 361619516, now seen corresponding path program 1 times [2025-03-08 07:43:59,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:59,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995786576] [2025-03-08 07:43:59,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:59,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:59,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:43:59,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:43:59,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:59,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:43:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:43:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:43:59,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995786576] [2025-03-08 07:43:59,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995786576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:43:59,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:43:59,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:43:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314386528] [2025-03-08 07:43:59,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:43:59,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:43:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:43:59,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:43:59,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:43:59,249 INFO L87 Difference]: Start difference. First operand 607 states and 904 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-03-08 07:43:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:43:59,857 INFO L93 Difference]: Finished difference Result 1732 states and 2586 transitions. [2025-03-08 07:43:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:43:59,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-03-08 07:43:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:43:59,860 INFO L225 Difference]: With dead ends: 1732 [2025-03-08 07:43:59,860 INFO L226 Difference]: Without dead ends: 619 [2025-03-08 07:43:59,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:43:59,861 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 807 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 3719 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:43:59,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 3719 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:43:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-08 07:43:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 614. [2025-03-08 07:43:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 1.4910277324632952) internal successors, (914), 613 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:43:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 914 transitions. [2025-03-08 07:43:59,871 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 914 transitions. Word has length 65 [2025-03-08 07:43:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:43:59,871 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 914 transitions. [2025-03-08 07:43:59,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-03-08 07:43:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 914 transitions. [2025-03-08 07:43:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:43:59,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:43:59,872 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-03-08 07:43:59,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:43:59,872 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:43:59,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:43:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash -301454720, now seen corresponding path program 1 times [2025-03-08 07:43:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:43:59,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144416950] [2025-03-08 07:43:59,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:43:59,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:43:59,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:43:59,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:43:59,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:43:59,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:00,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:00,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144416950] [2025-03-08 07:44:00,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144416950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:00,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:00,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:00,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840379880] [2025-03-08 07:44:00,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:00,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:00,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:00,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:00,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:00,017 INFO L87 Difference]: Start difference. First operand 614 states and 914 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-03-08 07:44:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:00,333 INFO L93 Difference]: Finished difference Result 1213 states and 1806 transitions. [2025-03-08 07:44:00,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:00,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-03-08 07:44:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:00,336 INFO L225 Difference]: With dead ends: 1213 [2025-03-08 07:44:00,336 INFO L226 Difference]: Without dead ends: 641 [2025-03-08 07:44:00,337 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-03-08 07:44:00,337 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 64 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:00,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 2899 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:44:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-03-08 07:44:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-03-08 07:44:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 1.4890625) internal successors, (953), 640 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:44:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2025-03-08 07:44:00,350 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 65 [2025-03-08 07:44:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:00,350 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2025-03-08 07:44:00,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-03-08 07:44:00,350 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2025-03-08 07:44:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:44:00,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:00,352 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-03-08 07:44:00,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:44:00,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:00,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:00,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1584669916, now seen corresponding path program 1 times [2025-03-08 07:44:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:00,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480573466] [2025-03-08 07:44:00,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:00,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:00,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:44:00,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:44:00,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:00,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:00,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:00,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480573466] [2025-03-08 07:44:00,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480573466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:00,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:00,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:44:00,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209012207] [2025-03-08 07:44:00,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:00,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:44:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:00,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:44:00,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:44:00,463 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-03-08 07:44:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:00,759 INFO L93 Difference]: Finished difference Result 1215 states and 1808 transitions. [2025-03-08 07:44:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:44:00,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-03-08 07:44:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:00,762 INFO L225 Difference]: With dead ends: 1215 [2025-03-08 07:44:00,762 INFO L226 Difference]: Without dead ends: 641 [2025-03-08 07:44:00,763 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-03-08 07:44:00,763 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 850 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:00,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1423 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:44:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-03-08 07:44:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-03-08 07:44:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 1.4875) internal successors, (952), 640 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-03-08 07:44:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 952 transitions. [2025-03-08 07:44:00,774 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 952 transitions. Word has length 66 [2025-03-08 07:44:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:00,774 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 952 transitions. [2025-03-08 07:44:00,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-03-08 07:44:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 952 transitions. [2025-03-08 07:44:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:44:00,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:00,775 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-03-08 07:44:00,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:44:00,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:00,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:00,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1455566495, now seen corresponding path program 1 times [2025-03-08 07:44:00,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:00,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012015423] [2025-03-08 07:44:00,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:00,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:00,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:44:00,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:44:00,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:00,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:00,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:00,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012015423] [2025-03-08 07:44:00,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012015423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:00,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:00,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874812390] [2025-03-08 07:44:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:00,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:00,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:00,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:00,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:00,941 INFO L87 Difference]: Start difference. First operand 641 states and 952 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-03-08 07:44:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:01,234 INFO L93 Difference]: Finished difference Result 1212 states and 1803 transitions. [2025-03-08 07:44:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:44:01,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-03-08 07:44:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:01,236 INFO L225 Difference]: With dead ends: 1212 [2025-03-08 07:44:01,236 INFO L226 Difference]: Without dead ends: 640 [2025-03-08 07:44:01,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:01,238 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 849 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:01,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1399 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:44:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-08 07:44:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 634. [2025-03-08 07:44:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.481832543443918) internal successors, (938), 633 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:44:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 938 transitions. [2025-03-08 07:44:01,250 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 938 transitions. Word has length 66 [2025-03-08 07:44:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:01,250 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 938 transitions. [2025-03-08 07:44:01,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-03-08 07:44:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 938 transitions. [2025-03-08 07:44:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:44:01,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:01,251 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-03-08 07:44:01,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:44:01,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:01,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash 995726229, now seen corresponding path program 1 times [2025-03-08 07:44:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:01,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587262621] [2025-03-08 07:44:01,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:01,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:44:01,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:44:01,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:01,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:01,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:01,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587262621] [2025-03-08 07:44:01,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587262621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:01,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:01,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:44:01,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557517921] [2025-03-08 07:44:01,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:01,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:44:01,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:01,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:44:01,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:44:01,417 INFO L87 Difference]: Start difference. First operand 634 states and 938 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-03-08 07:44:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:01,613 INFO L93 Difference]: Finished difference Result 1198 states and 1774 transitions. [2025-03-08 07:44:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:44:01,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-03-08 07:44:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:01,616 INFO L225 Difference]: With dead ends: 1198 [2025-03-08 07:44:01,616 INFO L226 Difference]: Without dead ends: 633 [2025-03-08 07:44:01,616 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-03-08 07:44:01,617 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 843 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:01,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1461 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-08 07:44:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2025-03-08 07:44:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.481012658227848) internal successors, (936), 632 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-03-08 07:44:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 936 transitions. [2025-03-08 07:44:01,627 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 936 transitions. Word has length 66 [2025-03-08 07:44:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:01,627 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 936 transitions. [2025-03-08 07:44:01,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-03-08 07:44:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 936 transitions. [2025-03-08 07:44:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:44:01,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:01,628 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-03-08 07:44:01,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:44:01,628 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:01,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:01,628 INFO L85 PathProgramCache]: Analyzing trace with hash -392977968, now seen corresponding path program 1 times [2025-03-08 07:44:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:01,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545582042] [2025-03-08 07:44:01,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:01,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:01,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:44:01,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:44:01,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:01,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:02,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:02,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545582042] [2025-03-08 07:44:02,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545582042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:02,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:02,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 07:44:02,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525274501] [2025-03-08 07:44:02,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:02,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 07:44:02,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:02,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 07:44:02,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:44:02,011 INFO L87 Difference]: Start difference. First operand 633 states and 936 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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-03-08 07:44:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:02,746 INFO L93 Difference]: Finished difference Result 1213 states and 1793 transitions. [2025-03-08 07:44:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:44:02,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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-03-08 07:44:02,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:02,748 INFO L225 Difference]: With dead ends: 1213 [2025-03-08 07:44:02,749 INFO L226 Difference]: Without dead ends: 649 [2025-03-08 07:44:02,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 07:44:02,750 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 867 mSDsluCounter, 4947 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 5670 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:02,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 5670 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:44:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-08 07:44:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 644. [2025-03-08 07:44:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.4758942457231727) internal successors, (949), 643 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-03-08 07:44:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 949 transitions. [2025-03-08 07:44:02,763 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 949 transitions. Word has length 67 [2025-03-08 07:44:02,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:02,764 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 949 transitions. [2025-03-08 07:44:02,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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-03-08 07:44:02,765 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 949 transitions. [2025-03-08 07:44:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:44:02,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:02,765 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-03-08 07:44:02,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:44:02,766 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:02,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:02,766 INFO L85 PathProgramCache]: Analyzing trace with hash -238603690, now seen corresponding path program 1 times [2025-03-08 07:44:02,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:02,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911357933] [2025-03-08 07:44:02,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:02,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:02,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:44:02,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:44:02,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:02,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:02,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911357933] [2025-03-08 07:44:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911357933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:02,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:02,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:44:02,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855894385] [2025-03-08 07:44:02,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:02,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:44:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:02,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:44:02,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:44:02,956 INFO L87 Difference]: Start difference. First operand 644 states and 949 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-03-08 07:44:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:03,390 INFO L93 Difference]: Finished difference Result 1223 states and 1803 transitions. [2025-03-08 07:44:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:44:03,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-03-08 07:44:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:03,393 INFO L225 Difference]: With dead ends: 1223 [2025-03-08 07:44:03,393 INFO L226 Difference]: Without dead ends: 648 [2025-03-08 07:44:03,394 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-03-08 07:44:03,394 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 9 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:03,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3601 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:44:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-08 07:44:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2025-03-08 07:44:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.4751552795031055) internal successors, (950), 644 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:44:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 950 transitions. [2025-03-08 07:44:03,404 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 950 transitions. Word has length 67 [2025-03-08 07:44:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:03,404 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 950 transitions. [2025-03-08 07:44:03,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-03-08 07:44:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 950 transitions. [2025-03-08 07:44:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:44:03,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:03,405 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-03-08 07:44:03,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:44:03,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:03,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1947501186, now seen corresponding path program 1 times [2025-03-08 07:44:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:03,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355770733] [2025-03-08 07:44:03,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:03,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:03,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:44:03,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:44:03,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:03,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:03,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:03,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355770733] [2025-03-08 07:44:03,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355770733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:03,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 07:44:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538531265] [2025-03-08 07:44:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 07:44:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:03,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 07:44:03,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:44:03,734 INFO L87 Difference]: Start difference. First operand 645 states and 950 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-03-08 07:44:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:04,459 INFO L93 Difference]: Finished difference Result 1232 states and 1814 transitions. [2025-03-08 07:44:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:44:04,459 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-03-08 07:44:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:04,461 INFO L225 Difference]: With dead ends: 1232 [2025-03-08 07:44:04,461 INFO L226 Difference]: Without dead ends: 656 [2025-03-08 07:44:04,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 07:44:04,463 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 865 mSDsluCounter, 4950 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 5674 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:04,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 5674 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:44:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-08 07:44:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 648. [2025-03-08 07:44:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 647 states have (on average 1.474497681607419) internal successors, (954), 647 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:44:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 954 transitions. [2025-03-08 07:44:04,474 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 954 transitions. Word has length 68 [2025-03-08 07:44:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:04,475 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 954 transitions. [2025-03-08 07:44:04,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-03-08 07:44:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 954 transitions. [2025-03-08 07:44:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:44:04,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:04,477 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-03-08 07:44:04,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:44:04,477 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:04,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1568665234, now seen corresponding path program 1 times [2025-03-08 07:44:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976329863] [2025-03-08 07:44:04,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:04,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:44:04,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:44:04,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:04,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:04,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:04,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976329863] [2025-03-08 07:44:04,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976329863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:04,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:04,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:44:04,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362244413] [2025-03-08 07:44:04,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:04,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:44:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:04,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:44:04,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:44:04,652 INFO L87 Difference]: Start difference. First operand 648 states and 954 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-03-08 07:44:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:05,161 INFO L93 Difference]: Finished difference Result 1236 states and 1818 transitions. [2025-03-08 07:44:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:44:05,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-03-08 07:44:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:05,164 INFO L225 Difference]: With dead ends: 1236 [2025-03-08 07:44:05,164 INFO L226 Difference]: Without dead ends: 657 [2025-03-08 07:44:05,165 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-03-08 07:44:05,165 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 6 mSDsluCounter, 4300 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5020 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:05,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5020 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:44:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-08 07:44:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2025-03-08 07:44:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.470948012232416) internal successors, (962), 654 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:44:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 962 transitions. [2025-03-08 07:44:05,177 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 962 transitions. Word has length 69 [2025-03-08 07:44:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:05,177 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 962 transitions. [2025-03-08 07:44:05,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-03-08 07:44:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 962 transitions. [2025-03-08 07:44:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:44:05,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:05,178 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-03-08 07:44:05,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:44:05,178 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:05,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:05,179 INFO L85 PathProgramCache]: Analyzing trace with hash 397558025, now seen corresponding path program 1 times [2025-03-08 07:44:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:05,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423947757] [2025-03-08 07:44:05,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:05,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:44:05,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:44:05,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:05,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:05,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:05,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423947757] [2025-03-08 07:44:05,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423947757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:05,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:05,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:44:05,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091306423] [2025-03-08 07:44:05,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:05,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:44:05,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:05,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:44:05,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:44:05,324 INFO L87 Difference]: Start difference. First operand 655 states and 962 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-08 07:44:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:06,108 INFO L93 Difference]: Finished difference Result 1772 states and 2604 transitions. [2025-03-08 07:44:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:44:06,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-08 07:44:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:06,112 INFO L225 Difference]: With dead ends: 1772 [2025-03-08 07:44:06,112 INFO L226 Difference]: Without dead ends: 1186 [2025-03-08 07:44:06,112 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-03-08 07:44:06,113 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 796 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:06,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 2179 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:44:06,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2025-03-08 07:44:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 708. [2025-03-08 07:44:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.454031117397454) internal successors, (1028), 707 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:44:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1028 transitions. [2025-03-08 07:44:06,127 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1028 transitions. Word has length 69 [2025-03-08 07:44:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:06,127 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1028 transitions. [2025-03-08 07:44:06,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-08 07:44:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1028 transitions. [2025-03-08 07:44:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 07:44:06,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:06,128 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-03-08 07:44:06,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:44:06,128 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:06,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:06,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2043094374, now seen corresponding path program 1 times [2025-03-08 07:44:06,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:06,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474636798] [2025-03-08 07:44:06,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:06,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 07:44:06,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 07:44:06,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:06,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:06,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:06,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474636798] [2025-03-08 07:44:06,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474636798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:06,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:06,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:44:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610481456] [2025-03-08 07:44:06,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:06,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:44:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:06,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:44:06,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:44:06,464 INFO L87 Difference]: Start difference. First operand 708 states and 1028 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-03-08 07:44:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:07,159 INFO L93 Difference]: Finished difference Result 1839 states and 2698 transitions. [2025-03-08 07:44:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:44:07,159 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-03-08 07:44:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:07,163 INFO L225 Difference]: With dead ends: 1839 [2025-03-08 07:44:07,163 INFO L226 Difference]: Without dead ends: 1234 [2025-03-08 07:44:07,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:44:07,164 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 2320 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:07,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2320 Valid, 3472 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:44:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2025-03-08 07:44:07,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 724. [2025-03-08 07:44:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 1.4439834024896265) internal successors, (1044), 723 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-03-08 07:44:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1044 transitions. [2025-03-08 07:44:07,178 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1044 transitions. Word has length 70 [2025-03-08 07:44:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:07,179 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1044 transitions. [2025-03-08 07:44:07,179 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-03-08 07:44:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1044 transitions. [2025-03-08 07:44:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 07:44:07,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:07,180 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-03-08 07:44:07,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:44:07,180 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:07,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash 862526448, now seen corresponding path program 1 times [2025-03-08 07:44:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:07,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108026052] [2025-03-08 07:44:07,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:07,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:07,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 07:44:07,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 07:44:07,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:07,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:07,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108026052] [2025-03-08 07:44:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108026052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:44:07,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291933846] [2025-03-08 07:44:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:07,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:44:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:07,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:44:07,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:44:07,502 INFO L87 Difference]: Start difference. First operand 724 states and 1044 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-03-08 07:44:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:08,059 INFO L93 Difference]: Finished difference Result 1329 states and 1927 transitions. [2025-03-08 07:44:08,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:44:08,059 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-03-08 07:44:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:08,062 INFO L225 Difference]: With dead ends: 1329 [2025-03-08 07:44:08,062 INFO L226 Difference]: Without dead ends: 735 [2025-03-08 07:44:08,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:44:08,063 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1647 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:08,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1647 Valid, 3513 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:44:08,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-08 07:44:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2025-03-08 07:44:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 1.4439834024896265) internal successors, (1044), 723 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-03-08 07:44:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1044 transitions. [2025-03-08 07:44:08,076 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1044 transitions. Word has length 71 [2025-03-08 07:44:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:08,076 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1044 transitions. [2025-03-08 07:44:08,076 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-03-08 07:44:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1044 transitions. [2025-03-08 07:44:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 07:44:08,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:08,077 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-03-08 07:44:08,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:44:08,078 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:08,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:08,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1628096754, now seen corresponding path program 1 times [2025-03-08 07:44:08,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:08,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814376483] [2025-03-08 07:44:08,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:08,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:08,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 07:44:08,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 07:44:08,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:08,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:08,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:08,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814376483] [2025-03-08 07:44:08,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814376483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:08,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:08,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:44:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551889014] [2025-03-08 07:44:08,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:08,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:44:08,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:08,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:44:08,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:44:08,277 INFO L87 Difference]: Start difference. First operand 724 states and 1044 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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-03-08 07:44:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:08,845 INFO L93 Difference]: Finished difference Result 1357 states and 1961 transitions. [2025-03-08 07:44:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:44:08,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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-03-08 07:44:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:08,848 INFO L225 Difference]: With dead ends: 1357 [2025-03-08 07:44:08,848 INFO L226 Difference]: Without dead ends: 734 [2025-03-08 07:44:08,849 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-03-08 07:44:08,849 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 869 mSDsluCounter, 3467 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:08,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 4163 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:44:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-08 07:44:08,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 727. [2025-03-08 07:44:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.440771349862259) internal successors, (1046), 726 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:44:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1046 transitions. [2025-03-08 07:44:08,861 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1046 transitions. Word has length 72 [2025-03-08 07:44:08,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:08,861 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1046 transitions. [2025-03-08 07:44:08,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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-03-08 07:44:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1046 transitions. [2025-03-08 07:44:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 07:44:08,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:08,862 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-03-08 07:44:08,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:44:08,862 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:08,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:08,863 INFO L85 PathProgramCache]: Analyzing trace with hash -653069153, now seen corresponding path program 1 times [2025-03-08 07:44:08,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:08,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717201217] [2025-03-08 07:44:08,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:08,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:08,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 07:44:08,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 07:44:08,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:08,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717201217] [2025-03-08 07:44:09,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717201217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:09,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:09,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:44:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126954695] [2025-03-08 07:44:09,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:09,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:44:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:09,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:44:09,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:44:09,022 INFO L87 Difference]: Start difference. First operand 727 states and 1046 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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-03-08 07:44:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:09,495 INFO L93 Difference]: Finished difference Result 1342 states and 1942 transitions. [2025-03-08 07:44:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:44:09,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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-03-08 07:44:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:09,498 INFO L225 Difference]: With dead ends: 1342 [2025-03-08 07:44:09,498 INFO L226 Difference]: Without dead ends: 734 [2025-03-08 07:44:09,499 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-03-08 07:44:09,499 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 5 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5057 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:09,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5057 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:44:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-08 07:44:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 717. [2025-03-08 07:44:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.446927374301676) internal successors, (1036), 716 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-03-08 07:44:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1036 transitions. [2025-03-08 07:44:09,511 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1036 transitions. Word has length 72 [2025-03-08 07:44:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:09,511 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1036 transitions. [2025-03-08 07:44:09,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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-03-08 07:44:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1036 transitions. [2025-03-08 07:44:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 07:44:09,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:09,512 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-03-08 07:44:09,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:44:09,512 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:09,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:09,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1305132766, now seen corresponding path program 1 times [2025-03-08 07:44:09,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:09,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356190777] [2025-03-08 07:44:09,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:09,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:09,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 07:44:09,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 07:44:09,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:09,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:09,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:44:09,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356190777] [2025-03-08 07:44:09,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356190777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:09,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:09,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:44:09,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813611007] [2025-03-08 07:44:09,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:09,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:44:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:44:09,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:44:09,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:44:09,613 INFO L87 Difference]: Start difference. First operand 717 states and 1036 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-03-08 07:44:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:09,860 INFO L93 Difference]: Finished difference Result 1327 states and 1926 transitions. [2025-03-08 07:44:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:44:09,861 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-03-08 07:44:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:09,863 INFO L225 Difference]: With dead ends: 1327 [2025-03-08 07:44:09,863 INFO L226 Difference]: Without dead ends: 717 [2025-03-08 07:44:09,863 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-03-08 07:44:09,865 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 871 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:09,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1407 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:44:09,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-08 07:44:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2025-03-08 07:44:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.4441340782122905) internal successors, (1034), 716 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:44:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1034 transitions. [2025-03-08 07:44:09,873 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1034 transitions. Word has length 72 [2025-03-08 07:44:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:09,873 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1034 transitions. [2025-03-08 07:44:09,874 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-03-08 07:44:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1034 transitions. [2025-03-08 07:44:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 07:44:09,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:09,874 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-03-08 07:44:09,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:44:09,874 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:09,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1401889378, now seen corresponding path program 1 times [2025-03-08 07:44:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:44:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496876847] [2025-03-08 07:44:09,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:44:09,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 07:44:09,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 07:44:09,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:09,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 07:44:09,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 07:44:09,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 07:44:09,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 07:44:09,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:09,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 07:44:09,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 07:44:09,973 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 07:44:09,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 07:44:09,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:44:09,979 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-03-08 07:44:10,025 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 07:44:10,035 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 07:44:10,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 07:44:10 BoogieIcfgContainer [2025-03-08 07:44:10,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 07:44:10,040 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 07:44:10,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 07:44:10,040 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 07:44:10,041 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:43:54" (3/4) ... [2025-03-08 07:44:10,043 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 07:44:10,043 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 07:44:10,045 INFO L158 Benchmark]: Toolchain (without parser) took 17568.74ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 112.6MB in the beginning and 300.4MB in the end (delta: -187.8MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2025-03-08 07:44:10,045 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:44:10,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.15ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 85.8MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 07:44:10,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.93ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 46.8MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 07:44:10,046 INFO L158 Benchmark]: Boogie Preprocessor took 211.53ms. Allocated memory is still 142.6MB. Free memory was 46.8MB in the beginning and 80.4MB in the end (delta: -33.6MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2025-03-08 07:44:10,046 INFO L158 Benchmark]: IcfgBuilder took 1723.80ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 80.4MB in the beginning and 52.5MB in the end (delta: 28.0MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2025-03-08 07:44:10,047 INFO L158 Benchmark]: TraceAbstraction took 15128.80ms. Allocated memory was 184.5MB in the beginning and 402.7MB in the end (delta: 218.1MB). Free memory was 52.5MB in the beginning and 300.4MB in the end (delta: -247.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:44:10,047 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 402.7MB. Free memory was 300.4MB in the beginning and 300.4MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:44:10,048 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.14ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.15ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 85.8MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.93ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 46.8MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 211.53ms. Allocated memory is still 142.6MB. Free memory was 46.8MB in the beginning and 80.4MB in the end (delta: -33.6MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1723.80ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 80.4MB in the beginning and 52.5MB in the end (delta: 28.0MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15128.80ms. Allocated memory was 184.5MB in the beginning and 402.7MB in the end (delta: 218.1MB). Free memory was 52.5MB in the beginning and 300.4MB in the end (delta: -247.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 402.7MB. Free memory was 300.4MB in the beginning and 300.4MB in the end (delta: 29.2kB). 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 107, overapproximation of bitwiseAnd at line 111, overapproximation of bitwiseAnd at line 116, overapproximation of bitwiseAnd at line 110. 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=-4294966796, 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, 894 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13379 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13379 mSDsluCounter, 66846 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51029 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16426 IncrementalHoareTripleChecker+Invalid, 16462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 15817 mSDtfsCounter, 16426 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=727occurred in iteration=20, InterpolantAutomatonStates: 130, 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, 1058 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1527 NumberOfCodeBlocks, 1527 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1432 ConstructedInterpolants, 0 QuantifiedInterpolants, 5273 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-03-08 07:44:10,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:44:11,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:44:12,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 07:44:12,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:44:12,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:44:12,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:44:12,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:44:12,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:44:12,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:44:12,119 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:44:12,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:44:12,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:44:12,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:44:12,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:44:12,120 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:44:12,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:44:12,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:44:12,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:44:12,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:44:12,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:44:12,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:44:12,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:44:12,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:44:12,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:44:12,122 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:44:12,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:44:12,122 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 07:44:12,122 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 07:44:12,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:44:12,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:44:12,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:44:12,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:44:12,123 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2025-03-08 07:44:12,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:44:12,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:44:12,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:44:12,400 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:44:12,401 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:44:12,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-08 07:44:13,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fde0835f/f8c46735583f4e3cb71b2bd2bf414548/FLAG5310994dd [2025-03-08 07:44:13,842 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:44:13,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-08 07:44:13,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fde0835f/f8c46735583f4e3cb71b2bd2bf414548/FLAG5310994dd [2025-03-08 07:44:13,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fde0835f/f8c46735583f4e3cb71b2bd2bf414548 [2025-03-08 07:44:13,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:44:13,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:44:13,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:44:13,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:44:13,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:44:13,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:44:13" (1/1) ... [2025-03-08 07:44:13,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c63878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:13, skipping insertion in model container [2025-03-08 07:44:13,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:44:13" (1/1) ... [2025-03-08 07:44:13,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:44:14,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2025-03-08 07:44:14,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:44:14,138 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:44:14,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2025-03-08 07:44:14,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:44:14,216 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:44:14,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14 WrapperNode [2025-03-08 07:44:14,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:44:14,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:44:14,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:44:14,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:44:14,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,266 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 452 [2025-03-08 07:44:14,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:44:14,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:44:14,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:44:14,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:44:14,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,292 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:44:14,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:44:14,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:44:14,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:44:14,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:44:14,323 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (1/1) ... [2025-03-08 07:44:14,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:44:14,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:44:14,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:44:14,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:44:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:44:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 07:44:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:44:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:44:14,483 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:44:14,484 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:44:14,853 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-08 07:44:14,854 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:44:14,860 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:44:14,861 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:44:14,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:44:14 BoogieIcfgContainer [2025-03-08 07:44:14,862 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:44:14,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:44:14,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:44:14,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:44:14,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:44:13" (1/3) ... [2025-03-08 07:44:14,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afa26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:44:14, skipping insertion in model container [2025-03-08 07:44:14,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:44:14" (2/3) ... [2025-03-08 07:44:14,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afa26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:44:14, skipping insertion in model container [2025-03-08 07:44:14,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:44:14" (3/3) ... [2025-03-08 07:44:14,870 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2025-03-08 07:44:14,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:44:14,882 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-03-08 07:44:14,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:44:14,932 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;@52399d37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:44:14,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 07:44:14,936 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-03-08 07:44:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 07:44:14,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:14,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 07:44:14,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:14,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 07:44:14,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:44:14,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1554470402] [2025-03-08 07:44:14,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:14,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:44:14,958 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:44:14,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:44:15,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 07:44:15,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 07:44:15,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:15,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:15,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 07:44:15,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:44:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:15,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:44:15,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:44:15,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554470402] [2025-03-08 07:44:15,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554470402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:44:15,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:44:15,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:44:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095146640] [2025-03-08 07:44:15,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:44:15,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:44:15,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:44:15,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:44:15,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:44:15,438 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-03-08 07:44:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:44:15,490 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-08 07:44:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:44:15,494 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-03-08 07:44:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:44:15,498 INFO L225 Difference]: With dead ends: 17 [2025-03-08 07:44:15,498 INFO L226 Difference]: Without dead ends: 9 [2025-03-08 07:44:15,500 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-03-08 07:44:15,502 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-03-08 07:44:15,502 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-03-08 07:44:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-08 07:44:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-08 07:44:15,518 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-03-08 07:44:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 07:44:15,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 07:44:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:44:15,521 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 07:44:15,521 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-03-08 07:44:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 07:44:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 07:44:15,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:44:15,521 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 07:44:15,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:44:15,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:15,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:44:15,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:44:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 07:44:15,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 07:44:15,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171748876] [2025-03-08 07:44:15,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:44:15,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:15,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:44:15,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:44:15,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:44:15,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 07:44:15,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 07:44:15,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:44:15,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:44:15,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 07:44:15,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:44:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:44:18,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:44:37,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 (_ bv255 32))))) (.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|))) (let ((.cse114 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse116 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse113 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse19 .cse14)))) (.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 (_ bv254 32))))) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|))) (let ((.cse3 (forall ((|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|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)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ 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 ((.cse204 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse205 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) .cse204) (= (_ bv0 8) .cse205) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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 .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse220 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse212 ((_ zero_extend 24) .cse205)) (.cse216 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse218 ((_ zero_extend 24) .cse204))) (let ((.cse217 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse223 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse218))))))) (.cse224 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse216))))))) (.cse211 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse214 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse222 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse212))))))) (.cse206 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse225 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse220)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse207 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse210 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse208 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse206 .cse207))))) (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 .cse206 .cse207))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse208 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse209 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse210 .cse211))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse209 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse210 .cse211)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse209 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse208 .cse12))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse219 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse216 .cse217))))) (let ((.cse221 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse218 .cse219))))) (let ((.cse215 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse220 .cse221))))) (let ((.cse213 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse214 .cse215))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse212 .cse213))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse214 .cse215))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ 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) (bvand .cse220 .cse221)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse222 .cse12))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse214)))))) .cse207))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse14 .cse223))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse224 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse211 .cse45)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse210 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse217))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse225 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse206 .cse45))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse212 .cse213))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse228 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse212 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse206 .cse225))))))) (.cse229 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse226 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse214 .cse12))) .cse222)))) (.cse227 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse228 .cse229))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse226 .cse227))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse232 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse233 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse218 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse224 .cse211)))))))) (let ((.cse230 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse232 .cse233)))) (.cse231 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse217 .cse14))) .cse223))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse230 .cse231))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse230 .cse231))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse232 .cse233)))))))))))))))))))))))))))))))))))) .cse7))))))))))))))))))) (.cse5 (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)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ 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)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ 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 ((.cse203 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse196 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse198 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse191 ((_ zero_extend 24) .cse203))) (let ((.cse190 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse191))))))) (.cse187 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse198))))))) (.cse193 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse196))))))) (.cse189 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse186 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse188 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse192 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|))))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse180 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse191 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse193))))))) (.cse181 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse178 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse189 .cse12))) .cse190)))) (.cse179 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse180 .cse181))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse178 .cse179))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse178 .cse179))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse180 .cse181)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse184 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse187 .cse188))))))) (.cse185 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse182 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse186 .cse14))))))) (.cse183 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse184 .cse185))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse182 .cse183))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse182 .cse183))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse184 .cse185))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse200 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse199 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse197 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse198 .cse186)))))))) (let ((.cse195 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse196 .cse197))))) (let ((.cse194 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse189 .cse195))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse194 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse189 .cse195))) ((_ 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 .cse186))) (_ bv0 32))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse190 .cse12))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse189)))))) .cse199))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse187 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse188 .cse45)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse200 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse186))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse193 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse45)))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse201 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse192 .cse199))))) (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 .cse192 .cse199))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse201 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse202 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse200 .cse188))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse202 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse200 .cse188)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse202 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse201 .cse12))))))))))))))))))))))))))))))))))))) (= (_ bv0 8) .cse203))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse177 (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|))) .cse113))) .cse113))) (_ 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 .cse177 |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| .cse177) (_ bv0 32))))))) (.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_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ 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 ((.cse176 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse164 ((_ zero_extend 24) .cse176)) (.cse175 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse173 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|))) (let ((.cse165 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse166 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse173))))))) (.cse161 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse160 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse175))))))) (.cse163 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse164))))))) (.cse162 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse159 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse153 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse164 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse166))))))) (.cse154 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse151 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse162 .cse12))) .cse163)))) (.cse152 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse153 .cse154))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse151 .cse152))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse151 .cse152))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse153 .cse154)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse157 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse160 .cse161))))))) (.cse158 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse155 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse159 .cse14))))))) (.cse156 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse157 .cse158))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse155 .cse156))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse155 .cse156))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse157 .cse158))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse167 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse170 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse168 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse165 .cse167))))) (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 .cse165 .cse167))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse168 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse169 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse170 .cse161))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse169 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse170 .cse161)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse169 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse168 .cse12))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse174 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse175 .cse159)))))))) (let ((.cse172 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse173 .cse174))))) (let ((.cse171 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse162 .cse172))))) (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 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse162)))))) .cse167))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse19))) .cse166))) ((_ 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 .cse161 .cse19))) .cse160))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse170 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse159)))))))))))) .cse23))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse163 .cse12)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse171 .cse164)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse171 .cse164))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse162 .cse172))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse173 .cse174))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse175 .cse159))) (_ bv0 32)))))))))))))))))))))))))))))))))))))))))))))))))))))) (_ bv0 8)) (= (_ bv0 8) .cse176))))) (.cse1 (forall ((|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))))) (.cse4 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse150 (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|))) .cse113))) .cse113))) (_ 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 .cse114 (bvashr (bvor .cse150 .cse116) |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| .cse150) (_ bv0 32)))))) (.cse6 (forall ((|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|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)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ 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 ((.cse148 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse149 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse128 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse120 ((_ zero_extend 24) .cse149)) (.cse124 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse126 ((_ zero_extend 24) .cse148))) (let ((.cse125 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse136 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse126))))))) (.cse134 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse124))))))) (.cse133 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse122 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse137 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse120))))))) (.cse131 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse132 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse128)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse135 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse130 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse127 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse124 .cse125))))) (let ((.cse129 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse126 .cse127))))) (let ((.cse123 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse128 .cse129))))) (let ((.cse121 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse122 .cse123))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse120 .cse121))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse122 .cse123))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse124 .cse125))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse126 .cse127)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse128 .cse129)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse120 .cse121))) ((_ 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 .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse122)))))) .cse130))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse131 .cse19))) .cse132))) ((_ 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 .cse133 .cse19))) .cse134))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse135 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse125)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse14 .cse136)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse137 .cse12)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse138 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse131 .cse130))))) (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 .cse131 .cse130))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse138 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse139 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse135 .cse133))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse139 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse135 .cse133)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse138 .cse12))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse142 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse120 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse131 .cse132))))))) (.cse143 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse140 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse122 .cse12))) .cse137)))) (.cse141 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse142 .cse143))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse140 .cse141))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse140 .cse141))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse142 .cse143)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse146 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse147 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse126 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse134 .cse133)))))))) (let ((.cse144 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse146 .cse147)))) (.cse145 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse125 .cse14))) .cse136))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse144 .cse145))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse144 .cse145))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse146 .cse147)))))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))))))))))))))) .cse7))))))))) (= (_ bv0 8) .cse148) (= (_ bv0 8) .cse149)))))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4) (or .cse3 .cse2) (or .cse5 .cse4 .cse1) (or .cse6 .cse2) (or .cse5 .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|)))))) (let ((.cse8 (let ((.cse118 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse113 ((_ 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|) .cse113)))))))))) .cse113))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse117 (bvor .cse118 ((_ 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| .cse117) |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| .cse117)))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse119 (bvor .cse118 ((_ 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| .cse119)) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse114 (bvashr (bvor .cse116 .cse119) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)))))))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse19 .cse12)))) (.cse59 (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 ((.cse112 (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|))))) .cse113))) .cse113))) (_ 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| .cse112))) (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| .cse112) |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 ((.cse115 (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|))))) .cse113))) .cse113))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand (bvor .cse114 (bvashr (bvor .cse115 .cse116) |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| .cse115)))))))) (and (or .cse8 .cse1 (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)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ 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))) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse27))))))) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse25)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse10))))) (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 .cse9 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse16))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse16)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse13 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse11 .cse12))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse27 .cse22)))))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse26))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 .cse18))) (_ bv0 32)))) ((_ 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 .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse17)))))) .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse19))) .cse20))) ((_ 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 .cse16 .cse19))) .cse21))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse22)))))))))))) .cse23))))))))) .cse24)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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 .cse17 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse26))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 .cse22))) (_ bv0 32)))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse20))))))) (.cse31 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse30 .cse31)))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 .cse29))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse31))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse29)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse16))))))) (.cse35 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse22 .cse14))))))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse35))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse32 .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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 .cse34 .cse35)))))))))))))))))))))))))))))))))))))))))))))))))) (_ bv0 8)))) (or .cse8 (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)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ 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))) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|))) (let ((.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse50))))))) (.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse42 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse48)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse37 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse40 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse36 .cse37))))) (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 .cse36 .cse37))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse40 .cse41))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse39 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 .cse41)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse39 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse38 .cse12))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse50 .cse46)))))))) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse49))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse42 .cse43))) (_ bv0 32)))) ((_ 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 .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse42)))))) .cse37))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse45)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse46))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse45)))))))))))) .cse24)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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 .cse42 .cse43))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse49))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse50 .cse46))) (_ bv0 32)))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse47))))))) (.cse54 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse53 .cse54)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse42 .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse51 .cse52))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse53 .cse54))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse52)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse44 .cse41))))))) (.cse58 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse55 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse46 .cse14))))))) (.cse56 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse57 .cse58))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse55 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse55 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse58)))))))))))))))))))))))))))))))))))))))))))))))))) (_ bv0 8))) .cse1) (or .cse59 (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)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ 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_~state_15~0#1_8| (_ 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 ((.cse60 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) .cse60) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse71 ((_ zero_extend 24) .cse60)) (.cse82 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse84 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|))) (let ((.cse75 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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 .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse84))))))) (.cse73 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse82))))))) (.cse70 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse71))))))) (.cse74 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse69 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse61 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse76))))))) (.cse62 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse63 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse61 .cse62)))) (.cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse74 .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse61 .cse62))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse63 .cse64)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse67 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse68 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse72 .cse73)))))))) (let ((.cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse67 .cse68)))) (.cse66 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse69 .cse14))) .cse70))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse65 .cse66))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse66))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse67 .cse68)))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse63 .cse64)))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse77 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse80 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse78 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse75 .cse77))))) (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 .cse75 .cse77))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse78 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse80 .cse73))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse79 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse80 .cse73)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse79 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse78 .cse12))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse83 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse82 .cse69))))) (let ((.cse85 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse71 .cse83))))) (let ((.cse81 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse84 .cse85))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse74 .cse81)))))) ((_ 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 .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse74)))))) .cse77))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse19))) .cse76))) ((_ 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 .cse73 .cse19))) .cse72))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse80 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse69)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse14 .cse70)))))))))))) .cse24)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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 .cse74 .cse81))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse82 .cse69))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse71 .cse83)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse84 .cse85))))))))))))))))))))))))))))))))))))))))))))))))))) .cse7)) (_ bv0 8)))))) (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_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ 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 ((.cse86 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) .cse86) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse106 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse104 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse97 ((_ zero_extend 24) .cse86))) (let ((.cse96 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse97))))))) (.cse98 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse104))))))) (.cse102 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse106))))))) (.cse100 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse95 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse99 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse101 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|))))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse87 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse101 .cse102))))))) (.cse88 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse89 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse87 .cse88)))) (.cse90 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse100 .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse87 .cse88))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse90)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse93 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse94 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse98 .cse99)))))))) (let ((.cse91 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse93 .cse94)))) (.cse92 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse95 .cse14))) .cse96))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse91 .cse92))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse91 .cse92))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse93 .cse94)))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse89 .cse90)))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse109 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse108 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse105 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse104 .cse95))))) (let ((.cse107 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse97 .cse105))))) (let ((.cse103 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse106 .cse107))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ 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 .cse100 .cse103))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse104 .cse95))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse97 .cse105)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse106 .cse107)))))))))))))))))) ((_ 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 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse100)))))) .cse108))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse14 .cse96))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse98 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse99 .cse45)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse109 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse95))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse102 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse101 .cse45)))))))))))) .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse100 .cse103))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse110 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse101 .cse108))))) (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 .cse101 .cse108))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse111 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse109 .cse99))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse111 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse109 .cse99)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse111 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse110 .cse12))))))))))))))))))))))))))))))) (_ bv1 32)))))))))) .cse59)))) (or .cse0 .cse4 .cse1) (or .cse4 .cse6)))))) is different from false [2025-03-08 07:44:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-08 07:44:37,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 07:44:37,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171748876] [2025-03-08 07:44:37,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171748876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:44:37,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:44:37,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 07:44:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218425688] [2025-03-08 07:44:37,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 07:44:37,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 07:44:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 07:44:37,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 07:44:37,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2025-03-08 07:44:37,966 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-03-08 07:44:39,393 WARN L249 Executor]: External (MP /storage/repos/ultimate/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-03-08 07:44:39,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:44:39,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2025-03-08 07:44:39,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-03-08 07:44:39,395 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:44:39,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:44:39,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 07:44:39,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:44:39,598 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/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-03-08 07:44:39,602 INFO L158 Benchmark]: Toolchain (without parser) took 25737.91ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 92.0MB in the beginning and 170.9MB in the end (delta: -79.0MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2025-03-08 07:44:39,602 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:44:39,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.33ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 69.9MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 07:44:39,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.31ms. Allocated memory is still 117.4MB. Free memory was 69.9MB in the beginning and 66.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 07:44:39,604 INFO L158 Benchmark]: Boogie Preprocessor took 54.37ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 61.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 07:44:39,604 INFO L158 Benchmark]: IcfgBuilder took 539.37ms. Allocated memory is still 117.4MB. Free memory was 61.6MB in the beginning and 54.2MB in the end (delta: 7.4MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2025-03-08 07:44:39,604 INFO L158 Benchmark]: TraceAbstraction took 24737.65ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 54.2MB in the beginning and 170.9MB in the end (delta: -116.7MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2025-03-08 07:44:39,608 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.33ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 69.9MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.31ms. Allocated memory is still 117.4MB. Free memory was 69.9MB in the beginning and 66.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.37ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 61.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 539.37ms. Allocated memory is still 117.4MB. Free memory was 61.6MB in the beginning and 54.2MB in the end (delta: 7.4MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24737.65ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 54.2MB in the beginning and 170.9MB in the end (delta: -116.7MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/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/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/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")