./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.krebs.1.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 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:57:46,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:57:46,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:57:46,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:57:46,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:57:46,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:57:46,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:57:46,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:57:46,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:57:46,293 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:57:46,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:57:46,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:57:46,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:57:46,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:57:46,294 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:57:46,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:57:46,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:57:46,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:57:46,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:57:46,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:57:46,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:57:46,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:57:46,296 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:57:46,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:57:46,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:57:46,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:57:46,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:57:46,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:57:46,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:57:46,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:57:46,297 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 -> 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 [2025-03-16 21:57:46,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:57:46,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:57:46,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:57:46,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:57:46,513 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:57:46,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2025-03-16 21:57:47,629 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0fff6f34/3f930c2938e64bd181e7e980429d1e88/FLAGfac44426b [2025-03-16 21:57:47,946 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:57:47,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2025-03-16 21:57:47,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0fff6f34/3f930c2938e64bd181e7e980429d1e88/FLAGfac44426b [2025-03-16 21:57:48,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0fff6f34/3f930c2938e64bd181e7e980429d1e88 [2025-03-16 21:57:48,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:57:48,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:57:48,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:57:48,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:57:48,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:57:48,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:48,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350ce49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48, skipping insertion in model container [2025-03-16 21:57:48,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:48,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:57:48,344 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.krebs.1.prop1-func-interl.c[1172,1185] [2025-03-16 21:57:48,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:57:48,522 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:57:48,529 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.krebs.1.prop1-func-interl.c[1172,1185] [2025-03-16 21:57:48,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:57:48,626 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:57:48,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48 WrapperNode [2025-03-16 21:57:48,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:57:48,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:57:48,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:57:48,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:57:48,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:48,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:48,914 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3251 [2025-03-16 21:57:48,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:57:48,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:57:48,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:57:48,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:57:48,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:48,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:48,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:49,075 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-16 21:57:49,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:49,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:49,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:49,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:49,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:49,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:49,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:57:49,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:57:49,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:57:49,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:57:49,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (1/1) ... [2025-03-16 21:57:49,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:57:49,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:57:49,316 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-16 21:57:49,318 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-16 21:57:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:57:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:57:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:57:49,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:57:49,527 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:57:49,528 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:57:51,948 INFO L? ?]: Removed 1861 outVars from TransFormulas that were not future-live. [2025-03-16 21:57:51,948 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:57:52,102 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:57:52,102 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:57:52,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:57:52 BoogieIcfgContainer [2025-03-16 21:57:52,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:57:52,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:57:52,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:57:52,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:57:52,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:57:48" (1/3) ... [2025-03-16 21:57:52,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250feae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:57:52, skipping insertion in model container [2025-03-16 21:57:52,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:57:48" (2/3) ... [2025-03-16 21:57:52,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250feae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:57:52, skipping insertion in model container [2025-03-16 21:57:52,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:57:52" (3/3) ... [2025-03-16 21:57:52,109 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.1.prop1-func-interl.c [2025-03-16 21:57:52,123 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:57:52,125 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.krebs.1.prop1-func-interl.c that has 1 procedures, 1076 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:57:52,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:57:52,206 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;@4b10fac0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:57:52,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:57:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 1076 states, 1074 states have (on average 1.5074487895716946) internal successors, (1619), 1075 states have internal predecessors, (1619), 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-16 21:57:52,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 21:57:52,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:57:52,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:57:52,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:57:52,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:57:52,225 INFO L85 PathProgramCache]: Analyzing trace with hash 934380660, now seen corresponding path program 1 times [2025-03-16 21:57:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:57:52,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633833522] [2025-03-16 21:57:52,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:57:52,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:57:52,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 21:57:52,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 21:57:52,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:57:52,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:57:52,884 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-16 21:57:52,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:57:52,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633833522] [2025-03-16 21:57:52,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633833522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:57:52,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:57:52,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:57:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592682379] [2025-03-16 21:57:52,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:57:52,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:57:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:57:52,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:57:52,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:57:52,907 INFO L87 Difference]: Start difference. First operand has 1076 states, 1074 states have (on average 1.5074487895716946) internal successors, (1619), 1075 states have internal predecessors, (1619), 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 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-16 21:57:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:57:53,420 INFO L93 Difference]: Finished difference Result 2047 states and 3083 transitions. [2025-03-16 21:57:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:57:53,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2025-03-16 21:57:53,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:57:53,439 INFO L225 Difference]: With dead ends: 2047 [2025-03-16 21:57:53,439 INFO L226 Difference]: Without dead ends: 1076 [2025-03-16 21:57:53,445 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-16 21:57:53,449 INFO L435 NwaCegarLoop]: 1351 mSDtfsCounter, 0 mSDsluCounter, 2697 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4048 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:57:53,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4048 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:57:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-03-16 21:57:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2025-03-16 21:57:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1075 states have (on average 1.5051162790697674) internal successors, (1618), 1075 states have internal predecessors, (1618), 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-16 21:57:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1618 transitions. [2025-03-16 21:57:53,516 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1618 transitions. Word has length 86 [2025-03-16 21:57:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:57:53,516 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1618 transitions. [2025-03-16 21:57:53,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-16 21:57:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1618 transitions. [2025-03-16 21:57:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 21:57:53,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:57:53,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:57:53,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:57:53,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:57:53,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:57:53,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1094289883, now seen corresponding path program 1 times [2025-03-16 21:57:53,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:57:53,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926151530] [2025-03-16 21:57:53,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:57:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:57:53,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 21:57:53,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 21:57:53,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:57:53,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:57:53,770 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-16 21:57:53,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:57:53,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926151530] [2025-03-16 21:57:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926151530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:57:53,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:57:53,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:57:53,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125877090] [2025-03-16 21:57:53,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:57:53,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:57:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:57:53,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:57:53,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:57:53,776 INFO L87 Difference]: Start difference. First operand 1076 states and 1618 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-16 21:57:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:57:54,294 INFO L93 Difference]: Finished difference Result 2049 states and 3082 transitions. [2025-03-16 21:57:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:57:54,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 87 [2025-03-16 21:57:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:57:54,300 INFO L225 Difference]: With dead ends: 2049 [2025-03-16 21:57:54,300 INFO L226 Difference]: Without dead ends: 1078 [2025-03-16 21:57:54,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-16 21:57:54,302 INFO L435 NwaCegarLoop]: 1351 mSDtfsCounter, 0 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:57:54,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4045 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:57:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-03-16 21:57:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2025-03-16 21:57:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.5041782729805013) internal successors, (1620), 1077 states have internal predecessors, (1620), 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-16 21:57:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1620 transitions. [2025-03-16 21:57:54,320 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1620 transitions. Word has length 87 [2025-03-16 21:57:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:57:54,321 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1620 transitions. [2025-03-16 21:57:54,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-16 21:57:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1620 transitions. [2025-03-16 21:57:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 21:57:54,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:57:54,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:57:54,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:57:54,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:57:54,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:57:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1926704497, now seen corresponding path program 1 times [2025-03-16 21:57:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:57:54,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073109682] [2025-03-16 21:57:54,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:57:54,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:57:54,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 21:57:54,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 21:57:54,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:57:54,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:57:54,486 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-16 21:57:54,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:57:54,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073109682] [2025-03-16 21:57:54,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073109682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:57:54,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:57:54,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:57:54,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407477546] [2025-03-16 21:57:54,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:57:54,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:57:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:57:54,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:57:54,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:57:54,487 INFO L87 Difference]: Start difference. First operand 1078 states and 1620 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-16 21:57:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:57:54,880 INFO L93 Difference]: Finished difference Result 2057 states and 3092 transitions. [2025-03-16 21:57:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:57:54,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 88 [2025-03-16 21:57:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:57:54,887 INFO L225 Difference]: With dead ends: 2057 [2025-03-16 21:57:54,887 INFO L226 Difference]: Without dead ends: 1084 [2025-03-16 21:57:54,889 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-16 21:57:54,891 INFO L435 NwaCegarLoop]: 1351 mSDtfsCounter, 4 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4040 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:57:54,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4040 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:57:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2025-03-16 21:57:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2025-03-16 21:57:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5032317636195753) internal successors, (1628), 1083 states have internal predecessors, (1628), 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-16 21:57:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1628 transitions. [2025-03-16 21:57:54,908 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1628 transitions. Word has length 88 [2025-03-16 21:57:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:57:54,909 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1628 transitions. [2025-03-16 21:57:54,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-16 21:57:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1628 transitions. [2025-03-16 21:57:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 21:57:54,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:57:54,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:57:54,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:57:54,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:57:54,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:57:54,913 INFO L85 PathProgramCache]: Analyzing trace with hash -519220625, now seen corresponding path program 1 times [2025-03-16 21:57:54,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:57:54,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373547228] [2025-03-16 21:57:54,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:57:54,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:57:54,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 21:57:54,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 21:57:54,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:57:54,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:57:55,124 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-16 21:57:55,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:57:55,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373547228] [2025-03-16 21:57:55,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373547228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:57:55,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:57:55,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:57:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645197868] [2025-03-16 21:57:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:57:55,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:57:55,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:57:55,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:57:55,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:57:55,126 INFO L87 Difference]: Start difference. First operand 1084 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-16 21:57:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:57:55,629 INFO L93 Difference]: Finished difference Result 2067 states and 3104 transitions. [2025-03-16 21:57:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:57:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 89 [2025-03-16 21:57:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:57:55,632 INFO L225 Difference]: With dead ends: 2067 [2025-03-16 21:57:55,632 INFO L226 Difference]: Without dead ends: 1088 [2025-03-16 21:57:55,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:57:55,636 INFO L435 NwaCegarLoop]: 1351 mSDtfsCounter, 0 mSDsluCounter, 4025 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5376 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:57:55,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5376 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:57:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-03-16 21:57:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1084. [2025-03-16 21:57:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5032317636195753) internal successors, (1628), 1083 states have internal predecessors, (1628), 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-16 21:57:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1628 transitions. [2025-03-16 21:57:55,654 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1628 transitions. Word has length 89 [2025-03-16 21:57:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:57:55,655 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1628 transitions. [2025-03-16 21:57:55,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-16 21:57:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1628 transitions. [2025-03-16 21:57:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 21:57:55,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:57:55,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:57:55,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:57:55,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:57:55,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:57:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1322573398, now seen corresponding path program 1 times [2025-03-16 21:57:55,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:57:55,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976949931] [2025-03-16 21:57:55,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:57:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:57:55,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 21:57:55,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 21:57:55,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:57:55,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:57:55,885 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-16 21:57:55,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:57:55,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976949931] [2025-03-16 21:57:55,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976949931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:57:55,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:57:55,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:57:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264580081] [2025-03-16 21:57:55,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:57:55,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:57:55,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:57:55,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:57:55,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:57:55,886 INFO L87 Difference]: Start difference. First operand 1084 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-16 21:57:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:57:57,191 INFO L93 Difference]: Finished difference Result 3026 states and 4546 transitions. [2025-03-16 21:57:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:57:57,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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 90 [2025-03-16 21:57:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:57:57,198 INFO L225 Difference]: With dead ends: 3026 [2025-03-16 21:57:57,198 INFO L226 Difference]: Without dead ends: 2047 [2025-03-16 21:57:57,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-16 21:57:57,199 INFO L435 NwaCegarLoop]: 1092 mSDtfsCounter, 1521 mSDsluCounter, 3163 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 4255 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:57:57,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 4255 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 21:57:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-03-16 21:57:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1131. [2025-03-16 21:57:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.5017699115044247) internal successors, (1697), 1130 states have internal predecessors, (1697), 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-16 21:57:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1697 transitions. [2025-03-16 21:57:57,224 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1697 transitions. Word has length 90 [2025-03-16 21:57:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:57:57,224 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1697 transitions. [2025-03-16 21:57:57,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-16 21:57:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1697 transitions. [2025-03-16 21:57:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 21:57:57,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:57:57,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:57:57,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:57:57,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:57:57,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:57:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash 765126508, now seen corresponding path program 1 times [2025-03-16 21:57:57,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:57:57,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386331707] [2025-03-16 21:57:57,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:57:57,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:57:57,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 21:57:57,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 21:57:57,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:57:57,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:57:57,464 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-16 21:57:57,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:57:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386331707] [2025-03-16 21:57:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386331707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:57:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:57:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:57:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946463293] [2025-03-16 21:57:57,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:57:57,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:57:57,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:57:57,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:57:57,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:57:57,465 INFO L87 Difference]: Start difference. First operand 1131 states and 1697 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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-16 21:57:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:57:58,375 INFO L93 Difference]: Finished difference Result 2110 states and 3168 transitions. [2025-03-16 21:57:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:57:58,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2025-03-16 21:57:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:57:58,379 INFO L225 Difference]: With dead ends: 2110 [2025-03-16 21:57:58,379 INFO L226 Difference]: Without dead ends: 1131 [2025-03-16 21:57:58,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:57:58,381 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 1542 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 3242 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:57:58,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 3242 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:57:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2025-03-16 21:57:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1131. [2025-03-16 21:57:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.4982300884955753) internal successors, (1693), 1130 states have internal predecessors, (1693), 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-16 21:57:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1693 transitions. [2025-03-16 21:57:58,398 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1693 transitions. Word has length 91 [2025-03-16 21:57:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:57:58,398 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1693 transitions. [2025-03-16 21:57:58,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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-16 21:57:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1693 transitions. [2025-03-16 21:57:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 21:57:58,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:57:58,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:57:58,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:57:58,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:57:58,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:57:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash -474145893, now seen corresponding path program 1 times [2025-03-16 21:57:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:57:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771350189] [2025-03-16 21:57:58,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:57:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:57:58,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 21:57:58,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 21:57:58,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:57:58,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:57:58,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 21:57:58,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 21:57:58,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 21:57:58,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:57:58,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:57:58,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 21:57:58,510 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 21:57:58,511 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:57:58,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:57:58,514 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:57:58,558 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:57:58,573 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:57:58,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:57:58 BoogieIcfgContainer [2025-03-16 21:57:58,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:57:58,578 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:57:58,578 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:57:58,578 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:57:58,579 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:57:52" (3/4) ... [2025-03-16 21:57:58,580 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 21:57:58,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:57:58,582 INFO L158 Benchmark]: Toolchain (without parser) took 10386.28ms. Allocated memory was 142.6MB in the beginning and 562.0MB in the end (delta: 419.4MB). Free memory was 103.5MB in the beginning and 226.5MB in the end (delta: -123.0MB). Peak memory consumption was 302.6MB. Max. memory is 16.1GB. [2025-03-16 21:57:58,582 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:57:58,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.39ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 57.1MB in the end (delta: 46.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-16 21:57:58,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 288.02ms. Allocated memory is still 142.6MB. Free memory was 57.1MB in the beginning and 58.6MB in the end (delta: -1.5MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2025-03-16 21:57:58,582 INFO L158 Benchmark]: Boogie Preprocessor took 375.89ms. Allocated memory was 142.6MB in the beginning and 159.4MB in the end (delta: 16.8MB). Free memory was 58.6MB in the beginning and 56.7MB in the end (delta: 1.9MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2025-03-16 21:57:58,582 INFO L158 Benchmark]: IcfgBuilder took 2810.49ms. Allocated memory was 159.4MB in the beginning and 478.2MB in the end (delta: 318.8MB). Free memory was 56.7MB in the beginning and 321.4MB in the end (delta: -264.7MB). Peak memory consumption was 282.7MB. Max. memory is 16.1GB. [2025-03-16 21:57:58,583 INFO L158 Benchmark]: TraceAbstraction took 6473.68ms. Allocated memory was 478.2MB in the beginning and 562.0MB in the end (delta: 83.9MB). Free memory was 321.4MB in the beginning and 226.5MB in the end (delta: 94.8MB). Peak memory consumption was 174.5MB. Max. memory is 16.1GB. [2025-03-16 21:57:58,583 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 562.0MB. Free memory was 226.5MB in the beginning and 226.5MB in the end (delta: 52.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:57:58,584 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.39ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 57.1MB in the end (delta: 46.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 288.02ms. Allocated memory is still 142.6MB. Free memory was 57.1MB in the beginning and 58.6MB in the end (delta: -1.5MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 375.89ms. Allocated memory was 142.6MB in the beginning and 159.4MB in the end (delta: 16.8MB). Free memory was 58.6MB in the beginning and 56.7MB in the end (delta: 1.9MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * IcfgBuilder took 2810.49ms. Allocated memory was 159.4MB in the beginning and 478.2MB in the end (delta: 318.8MB). Free memory was 56.7MB in the beginning and 321.4MB in the end (delta: -264.7MB). Peak memory consumption was 282.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6473.68ms. Allocated memory was 478.2MB in the beginning and 562.0MB in the end (delta: 83.9MB). Free memory was 321.4MB in the beginning and 226.5MB in the end (delta: 94.8MB). Peak memory consumption was 174.5MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 562.0MB. Free memory was 226.5MB in the beginning and 226.5MB in the end (delta: 52.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 173, overapproximation of bitwiseAnd at line 171. 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 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 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_2 var_5 = 0; [L39] const SORT_1 var_30 = 0; [L40] const SORT_3 var_59 = 0; [L41] const SORT_4 var_61 = 5; [L42] const SORT_2 var_65 = 2; [L43] const SORT_4 var_69 = 1; [L44] const SORT_2 var_75 = 4; [L45] const SORT_4 var_77 = 2; [L46] const SORT_2 var_101 = 12; [L47] const SORT_2 var_154 = 15; [L48] const SORT_2 var_169 = 10; [L50] SORT_1 input_66; [L51] SORT_1 input_76; [L52] SORT_1 input_82; [L53] SORT_1 input_106; [L54] SORT_1 input_109; [L55] SORT_1 input_110; [L56] SORT_1 input_126; [L57] SORT_1 input_145; [L58] SORT_1 input_187; [L59] SORT_1 input_208; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L61] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L62] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L63] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L64] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L65] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L66] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L67] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L68] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L69] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L70] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L71] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L72] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L73] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L74] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L75] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L76] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L77] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L78] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L79] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L80] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L81] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L82] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L83] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L84] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L85] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L86] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] SORT_2 init_7_arg_1 = var_5; [L89] state_6 = init_7_arg_1 [L90] SORT_2 init_9_arg_1 = var_5; [L91] state_8 = init_9_arg_1 [L92] SORT_2 init_11_arg_1 = var_5; [L93] state_10 = init_11_arg_1 [L94] SORT_2 init_13_arg_1 = var_5; [L95] state_12 = init_13_arg_1 [L96] SORT_2 init_15_arg_1 = var_5; [L97] state_14 = init_15_arg_1 [L98] SORT_2 init_17_arg_1 = var_5; [L99] state_16 = init_17_arg_1 [L100] SORT_2 init_19_arg_1 = var_5; [L101] state_18 = init_19_arg_1 [L102] SORT_2 init_21_arg_1 = var_5; [L103] state_20 = init_21_arg_1 [L104] SORT_2 init_23_arg_1 = var_5; [L105] state_22 = init_23_arg_1 [L106] SORT_2 init_25_arg_1 = var_5; [L107] state_24 = init_25_arg_1 [L108] SORT_2 init_27_arg_1 = var_5; [L109] state_26 = init_27_arg_1 [L110] SORT_2 init_29_arg_1 = var_5; [L111] state_28 = init_29_arg_1 [L112] SORT_1 init_32_arg_1 = var_30; [L113] state_31 = init_32_arg_1 [L114] SORT_1 init_34_arg_1 = var_30; [L115] state_33 = init_34_arg_1 [L116] SORT_1 init_36_arg_1 = var_30; [L117] state_35 = init_36_arg_1 [L118] SORT_1 init_38_arg_1 = var_30; [L119] state_37 = init_38_arg_1 [L120] SORT_1 init_40_arg_1 = var_30; [L121] state_39 = init_40_arg_1 [L122] SORT_1 init_42_arg_1 = var_30; [L123] state_41 = init_42_arg_1 [L124] SORT_1 init_44_arg_1 = var_30; [L125] state_43 = init_44_arg_1 [L126] SORT_1 init_46_arg_1 = var_30; [L127] state_45 = init_46_arg_1 [L128] SORT_1 init_48_arg_1 = var_30; [L129] state_47 = init_48_arg_1 [L130] SORT_1 init_50_arg_1 = var_30; [L131] state_49 = init_50_arg_1 [L132] SORT_1 init_52_arg_1 = var_30; [L133] state_51 = init_52_arg_1 [L134] SORT_1 init_54_arg_1 = var_30; [L135] state_53 = init_54_arg_1 [L136] SORT_1 init_56_arg_1 = var_30; [L137] state_55 = init_56_arg_1 [L138] SORT_1 init_58_arg_1 = var_30; [L139] state_57 = init_58_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L142] input_66 = __VERIFIER_nondet_uchar() [L143] EXPR input_66 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L143] input_66 = input_66 & mask_SORT_1 [L144] input_76 = __VERIFIER_nondet_uchar() [L145] EXPR input_76 & mask_SORT_1 VAL [input_66=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L145] input_76 = input_76 & mask_SORT_1 [L146] input_82 = __VERIFIER_nondet_uchar() [L147] EXPR input_82 & mask_SORT_1 VAL [input_66=0, input_76=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L147] input_82 = input_82 & mask_SORT_1 [L148] input_106 = __VERIFIER_nondet_uchar() [L149] EXPR input_106 & mask_SORT_1 VAL [input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L149] input_106 = input_106 & mask_SORT_1 [L150] input_109 = __VERIFIER_nondet_uchar() [L151] EXPR input_109 & mask_SORT_1 VAL [input_106=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L151] input_109 = input_109 & mask_SORT_1 [L152] input_110 = __VERIFIER_nondet_uchar() [L153] EXPR input_110 & mask_SORT_1 VAL [input_106=0, input_109=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L153] input_110 = input_110 & mask_SORT_1 [L154] input_126 = __VERIFIER_nondet_uchar() [L155] EXPR input_126 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L155] input_126 = input_126 & mask_SORT_1 [L156] input_145 = __VERIFIER_nondet_uchar() [L157] EXPR input_145 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L157] input_145 = input_145 & mask_SORT_1 [L158] input_187 = __VERIFIER_nondet_uchar() [L159] EXPR input_187 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L159] input_187 = input_187 & mask_SORT_1 [L160] input_208 = __VERIFIER_nondet_uchar() [L163] SORT_3 var_60_arg_0 = var_59; [L164] SORT_2 var_60_arg_1 = state_28; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60_arg_0=0, var_60_arg_1=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L165] EXPR ((SORT_4)var_60_arg_0 << 8) | var_60_arg_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L165] SORT_4 var_60 = ((SORT_4)var_60_arg_0 << 8) | var_60_arg_1; [L166] EXPR var_60 & mask_SORT_4 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L166] var_60 = var_60 & mask_SORT_4 [L167] SORT_4 var_62_arg_0 = var_60; [L168] SORT_4 var_62_arg_1 = var_61; [L169] SORT_1 var_62 = var_62_arg_0 <= var_62_arg_1; [L170] SORT_1 var_63_arg_0 = ~state_57; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_62=1, var_63_arg_0=-1, var_65=2, var_69=1, var_75=4, var_77=2] [L171] EXPR var_63_arg_0 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_62=1, var_65=2, var_69=1, var_75=4, var_77=2] [L171] var_63_arg_0 = var_63_arg_0 & mask_SORT_1 [L172] SORT_1 var_63_arg_1 = ~var_62; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_63_arg_0=1, var_63_arg_1=-2, var_65=2, var_69=1, var_75=4, var_77=2] [L173] EXPR var_63_arg_1 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_63_arg_0=1, var_65=2, var_69=1, var_75=4, var_77=2] [L173] var_63_arg_1 = var_63_arg_1 & mask_SORT_1 [L174] EXPR var_63_arg_0 & var_63_arg_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L174] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L175] EXPR var_63 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L175] var_63 = var_63 & mask_SORT_1 [L176] SORT_1 bad_64_arg_0 = var_63; [L177] CALL __VERIFIER_assert(!(bad_64_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1076 locations, 1619 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3067 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3067 mSDsluCounter, 25006 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17426 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7138 IncrementalHoareTripleChecker+Invalid, 7141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 7580 mSDtfsCounter, 7138 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1131occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 920 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 525 ConstructedInterpolants, 0 QuantifiedInterpolants, 1266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-16 21:57:58,600 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.krebs.1.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 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:58:00,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:58:00,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 21:58:00,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:58:00,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:58:00,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:58:00,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:58:00,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:58:00,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:58:00,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:58:00,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:58:00,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:58:00,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:58:00,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:58:00,449 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:58:00,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:58:00,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:58:00,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:58:00,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:58:00,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:58:00,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:58:00,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 21:58:00,450 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 21:58:00,450 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 21:58:00,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:58:00,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:58:00,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:58:00,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:58:00,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:58:00,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:58:00,451 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 -> 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 [2025-03-16 21:58:00,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:58:00,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:58:00,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:58:00,704 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:58:00,705 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:58:00,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2025-03-16 21:58:01,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b2b2b6e/b4fab80c7e8f49d5841ff13c6ab2c578/FLAGb741cb0e8 [2025-03-16 21:58:02,150 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:58:02,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2025-03-16 21:58:02,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b2b2b6e/b4fab80c7e8f49d5841ff13c6ab2c578/FLAGb741cb0e8 [2025-03-16 21:58:02,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b2b2b6e/b4fab80c7e8f49d5841ff13c6ab2c578 [2025-03-16 21:58:02,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:58:02,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:58:02,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:58:02,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:58:02,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:58:02,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:02,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50afa44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02, skipping insertion in model container [2025-03-16 21:58:02,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:02,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:58:02,626 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.krebs.1.prop1-func-interl.c[1172,1185] [2025-03-16 21:58:02,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:58:02,828 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:58:02,836 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.krebs.1.prop1-func-interl.c[1172,1185] [2025-03-16 21:58:02,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:58:02,917 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:58:02,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02 WrapperNode [2025-03-16 21:58:02,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:58:02,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:58:02,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:58:02,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:58:02,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:02,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:02,991 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1115 [2025-03-16 21:58:02,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:58:02,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:58:02,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:58:02,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:58:02,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:02,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:03,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:03,030 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-16 21:58:03,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:03,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:03,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:03,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:03,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:03,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:03,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:58:03,120 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:58:03,121 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:58:03,121 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:58:03,121 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (1/1) ... [2025-03-16 21:58:03,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:58:03,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:58:03,143 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-16 21:58:03,146 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-16 21:58:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:58:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 21:58:03,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:58:03,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:58:03,332 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:58:03,333 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:58:04,027 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-16 21:58:04,027 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:58:04,033 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:58:04,034 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:58:04,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:58:04 BoogieIcfgContainer [2025-03-16 21:58:04,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:58:04,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:58:04,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:58:04,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:58:04,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:58:02" (1/3) ... [2025-03-16 21:58:04,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16716f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:58:04, skipping insertion in model container [2025-03-16 21:58:04,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:58:02" (2/3) ... [2025-03-16 21:58:04,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16716f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:58:04, skipping insertion in model container [2025-03-16 21:58:04,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:58:04" (3/3) ... [2025-03-16 21:58:04,043 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.1.prop1-func-interl.c [2025-03-16 21:58:04,054 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:58:04,055 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.krebs.1.prop1-func-interl.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:58:04,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:58:04,100 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;@23f98006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:58:04,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:58:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:58:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 21:58:04,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:58:04,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 21:58:04,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:58:04,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:58:04,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 21:58:04,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:58:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949557486] [2025-03-16 21:58:04,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:58:04,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:58:04,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:58:04,124 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-16 21:58:04,127 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-16 21:58:04,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 21:58:04,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 21:58:04,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:58:04,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:58:04,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 21:58:04,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:58:04,507 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-16 21:58:04,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:58:04,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:58:04,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949557486] [2025-03-16 21:58:04,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949557486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:58:04,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:58:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:58:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324459224] [2025-03-16 21:58:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:58:04,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:58:04,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:58:04,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:58:04,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:58:04,528 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 21:58:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:58:04,607 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 21:58:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:58:04,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-16 21:58:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:58:04,612 INFO L225 Difference]: With dead ends: 16 [2025-03-16 21:58:04,613 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 21:58:04,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 21:58:04,616 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 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-16 21:58:04,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:58:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 21:58:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 21:58:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-16 21:58:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 21:58:04,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 21:58:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:58:04,635 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 21:58:04,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 21:58:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 21:58:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 21:58:04,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:58:04,636 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 21:58:04,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 21:58:04,836 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-16 21:58:04,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:58:04,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:58:04,837 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 21:58:04,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:58:04,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1787345604] [2025-03-16 21:58:04,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:58:04,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:58:04,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:58:04,840 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-16 21:58:04,841 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-16 21:58:05,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 21:58:05,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 21:58:05,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:58:05,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:58:05,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 21:58:05,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:58:05,438 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-16 21:58:05,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:58:19,529 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-16 21:58:19,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:58:19,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787345604] [2025-03-16 21:58:19,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787345604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:58:19,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:58:19,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-16 21:58:19,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974573913] [2025-03-16 21:58:19,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:58:19,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 21:58:19,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:58:19,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 21:58:19,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=88, Unknown=3, NotChecked=0, Total=132 [2025-03-16 21:58:19,531 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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-16 21:58:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:58:22,811 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-16 21:58:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:58:22,812 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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 7 [2025-03-16 21:58:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:58:22,812 INFO L225 Difference]: With dead ends: 17 [2025-03-16 21:58:22,812 INFO L226 Difference]: Without dead ends: 15 [2025-03-16 21:58:22,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=92, Invalid=177, Unknown=3, NotChecked=0, Total=272 [2025-03-16 21:58:22,813 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:58:22,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 21:58:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-16 21:58:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-16 21:58:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-16 21:58:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-16 21:58:22,816 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-03-16 21:58:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:58:22,816 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-16 21:58:22,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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-16 21:58:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-16 21:58:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 21:58:22,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:58:22,816 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-03-16 21:58:22,825 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-16 21:58:23,017 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-16 21:58:23,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:58:23,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:58:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 2 times [2025-03-16 21:58:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:58:23,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744776466] [2025-03-16 21:58:23,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 21:58:23,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:58:23,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:58:23,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:58:23,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 21:58:23,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-16 21:58:23,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 21:58:23,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 21:58:23,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:58:23,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-16 21:58:23,420 INFO L279 TraceCheckSpWp]: Computing forward predicates...