./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.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.bakery.4.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 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:00:52,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:00:52,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:00:52,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:00:52,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:00:52,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:00:52,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:00:52,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:00:52,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:00:52,349 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:00:52,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:00:52,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:00:52,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:00:52,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:00:52,350 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:00:52,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:00:52,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:00:52,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:00:52,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:00:52,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:00:52,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:00:52,351 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:00:52,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:00:52,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:00:52,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:00:52,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:00:52,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:00:52,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:00:52,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:00:52,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:00:52,352 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 -> 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 [2025-03-16 21:00:52,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:00:52,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:00:52,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:00:52,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:00:52,614 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:00:52,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-16 21:00:53,725 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d268095/94ec5fa9477442d49605b42a3464e336/FLAG67c87eeb8 [2025-03-16 21:00:54,030 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:00:54,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-16 21:00:54,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d268095/94ec5fa9477442d49605b42a3464e336/FLAG67c87eeb8 [2025-03-16 21:00:54,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d268095/94ec5fa9477442d49605b42a3464e336 [2025-03-16 21:00:54,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:00:54,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:00:54,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:00:54,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:00:54,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:00:54,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:54,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54, skipping insertion in model container [2025-03-16 21:00:54,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:54,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:00:54,250 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.bakery.4.prop1-func-interl.c[1173,1186] [2025-03-16 21:00:54,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:00:54,465 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:00:54,476 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.bakery.4.prop1-func-interl.c[1173,1186] [2025-03-16 21:00:54,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:00:54,590 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:00:54,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54 WrapperNode [2025-03-16 21:00:54,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:00:54,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:00:54,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:00:54,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:00:54,596 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:00:54" (1/1) ... [2025-03-16 21:00:54,633 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:00:54" (1/1) ... [2025-03-16 21:00:55,007 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5233 [2025-03-16 21:00:55,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:00:55,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:00:55,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:00:55,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:00:55,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:55,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:55,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:55,216 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:00:55,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:55,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:55,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:55,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:55,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:55,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:55,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:00:55,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:00:55,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:00:55,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:00:55,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (1/1) ... [2025-03-16 21:00:55,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:00:55,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:00:55,546 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:00:55,551 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:00:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:00:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:00:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:00:55,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:00:55,817 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:00:55,819 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:01:00,218 INFO L? ?]: Removed 2931 outVars from TransFormulas that were not future-live. [2025-03-16 21:01:00,218 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:01:00,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:01:00,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:01:00,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:01:00 BoogieIcfgContainer [2025-03-16 21:01:00,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:01:00,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:01:00,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:01:00,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:01:00,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:00:54" (1/3) ... [2025-03-16 21:01:00,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1385f577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:01:00, skipping insertion in model container [2025-03-16 21:01:00,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:00:54" (2/3) ... [2025-03-16 21:01:00,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1385f577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:01:00, skipping insertion in model container [2025-03-16 21:01:00,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:01:00" (3/3) ... [2025-03-16 21:01:00,428 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-16 21:01:00,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:01:00,443 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c that has 1 procedures, 1800 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:01:00,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:01:00,532 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;@57401a12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:01:00,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:01:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 1800 states, 1798 states have (on average 1.5) internal successors, (2697), 1799 states have internal predecessors, (2697), 0 states have call successors, (0), 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:01:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 21:01:00,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:01:00,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:01:00,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:01:00,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:01:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -628923616, now seen corresponding path program 1 times [2025-03-16 21:01:00,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:01:00,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282276575] [2025-03-16 21:01:00,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:01:00,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:01:00,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 21:01:00,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 21:01:00,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:01:00,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:01:01,351 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:01:01,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:01:01,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282276575] [2025-03-16 21:01:01,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282276575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:01:01,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:01:01,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:01:01,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689828479] [2025-03-16 21:01:01,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:01:01,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:01:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:01:01,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:01:01,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:01:01,379 INFO L87 Difference]: Start difference. First operand has 1800 states, 1798 states have (on average 1.5) internal successors, (2697), 1799 states have internal predecessors, (2697), 0 states have call successors, (0), 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 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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:01:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:01:02,292 INFO L93 Difference]: Finished difference Result 3487 states and 5227 transitions. [2025-03-16 21:01:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:01:02,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 21:01:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:01:02,317 INFO L225 Difference]: With dead ends: 3487 [2025-03-16 21:01:02,317 INFO L226 Difference]: Without dead ends: 1800 [2025-03-16 21:01:02,322 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:01:02,324 INFO L435 NwaCegarLoop]: 2244 mSDtfsCounter, 0 mSDsluCounter, 4483 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6727 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:01:02,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6727 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:01:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-03-16 21:01:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1800. [2025-03-16 21:01:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1799 states have (on average 1.4986103390772652) internal successors, (2696), 1799 states have internal predecessors, (2696), 0 states have call successors, (0), 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:01:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2696 transitions. [2025-03-16 21:01:02,410 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2696 transitions. Word has length 106 [2025-03-16 21:01:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:01:02,411 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2696 transitions. [2025-03-16 21:01:02,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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:01:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2696 transitions. [2025-03-16 21:01:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 21:01:02,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:01:02,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:01:02,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:01:02,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:01:02,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:01:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1982886306, now seen corresponding path program 1 times [2025-03-16 21:01:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:01:02,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051996317] [2025-03-16 21:01:02,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:01:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:01:02,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 21:01:02,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 21:01:02,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:01:02,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:01:02,687 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:01:02,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:01:02,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051996317] [2025-03-16 21:01:02,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051996317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:01:02,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:01:02,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:01:02,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686138772] [2025-03-16 21:01:02,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:01:02,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:01:02,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:01:02,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:01:02,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:01:02,691 INFO L87 Difference]: Start difference. First operand 1800 states and 2696 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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:01:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:01:03,383 INFO L93 Difference]: Finished difference Result 3489 states and 5226 transitions. [2025-03-16 21:01:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:01:03,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-16 21:01:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:01:03,390 INFO L225 Difference]: With dead ends: 3489 [2025-03-16 21:01:03,390 INFO L226 Difference]: Without dead ends: 1802 [2025-03-16 21:01:03,392 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:01:03,393 INFO L435 NwaCegarLoop]: 2244 mSDtfsCounter, 0 mSDsluCounter, 4480 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6724 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:01:03,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6724 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:01:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2025-03-16 21:01:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2025-03-16 21:01:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 1.4980566352026652) internal successors, (2698), 1801 states have internal predecessors, (2698), 0 states have call successors, (0), 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:01:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2698 transitions. [2025-03-16 21:01:03,422 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2698 transitions. Word has length 107 [2025-03-16 21:01:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:01:03,423 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2698 transitions. [2025-03-16 21:01:03,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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:01:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2698 transitions. [2025-03-16 21:01:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 21:01:03,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:01:03,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:01:03,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:01:03,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:01:03,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:01:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1023521957, now seen corresponding path program 1 times [2025-03-16 21:01:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:01:03,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480708960] [2025-03-16 21:01:03,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:01:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:01:03,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 21:01:03,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 21:01:03,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:01:03,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:01:03,650 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:01:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:01:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480708960] [2025-03-16 21:01:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480708960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:01:03,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:01:03,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:01:03,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52709030] [2025-03-16 21:01:03,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:01:03,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:01:03,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:01:03,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:01:03,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:01:03,652 INFO L87 Difference]: Start difference. First operand 1802 states and 2698 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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:01:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:01:04,305 INFO L93 Difference]: Finished difference Result 3493 states and 5230 transitions. [2025-03-16 21:01:04,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:01:04,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-16 21:01:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:01:04,311 INFO L225 Difference]: With dead ends: 3493 [2025-03-16 21:01:04,311 INFO L226 Difference]: Without dead ends: 1804 [2025-03-16 21:01:04,314 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:01:04,317 INFO L435 NwaCegarLoop]: 2244 mSDtfsCounter, 0 mSDsluCounter, 4475 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6719 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:01:04,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6719 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:01:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2025-03-16 21:01:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2025-03-16 21:01:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.497504159733777) internal successors, (2700), 1803 states have internal predecessors, (2700), 0 states have call successors, (0), 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:01:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2700 transitions. [2025-03-16 21:01:04,347 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2700 transitions. Word has length 108 [2025-03-16 21:01:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:01:04,347 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2700 transitions. [2025-03-16 21:01:04,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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:01:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2700 transitions. [2025-03-16 21:01:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 21:01:04,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:01:04,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:01:04,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:01:04,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:01:04,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:01:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash 223955687, now seen corresponding path program 1 times [2025-03-16 21:01:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:01:04,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93051694] [2025-03-16 21:01:04,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:01:04,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:01:04,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 21:01:04,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 21:01:04,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:01:04,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:01:04,540 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:01:04,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:01:04,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93051694] [2025-03-16 21:01:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93051694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:01:04,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:01:04,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:01:04,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78471624] [2025-03-16 21:01:04,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:01:04,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:01:04,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:01:04,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:01:04,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:01:04,543 INFO L87 Difference]: Start difference. First operand 1804 states and 2700 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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:01:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:01:05,255 INFO L93 Difference]: Finished difference Result 3503 states and 5242 transitions. [2025-03-16 21:01:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:01:05,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 21:01:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:01:05,263 INFO L225 Difference]: With dead ends: 3503 [2025-03-16 21:01:05,263 INFO L226 Difference]: Without dead ends: 1812 [2025-03-16 21:01:05,265 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:01:05,266 INFO L435 NwaCegarLoop]: 2244 mSDtfsCounter, 3 mSDsluCounter, 4475 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6719 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:01:05,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6719 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:01:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2025-03-16 21:01:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1808. [2025-03-16 21:01:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.4975096845600442) internal successors, (2706), 1807 states have internal predecessors, (2706), 0 states have call successors, (0), 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:01:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2706 transitions. [2025-03-16 21:01:05,300 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2706 transitions. Word has length 109 [2025-03-16 21:01:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:01:05,300 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2706 transitions. [2025-03-16 21:01:05,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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:01:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2706 transitions. [2025-03-16 21:01:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 21:01:05,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:01:05,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:01:05,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:01:05,302 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:01:05,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:01:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash -947508074, now seen corresponding path program 1 times [2025-03-16 21:01:05,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:01:05,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054563242] [2025-03-16 21:01:05,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:01:05,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:01:05,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 21:01:05,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 21:01:05,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:01:05,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:01:05,589 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:01:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:01:05,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054563242] [2025-03-16 21:01:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054563242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:01:05,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:01:05,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:01:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959705432] [2025-03-16 21:01:05,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:01:05,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:01:05,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:01:05,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:01:05,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:01:05,591 INFO L87 Difference]: Start difference. First operand 1808 states and 2706 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:01:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:01:07,761 INFO L93 Difference]: Finished difference Result 5182 states and 7756 transitions. [2025-03-16 21:01:07,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:01:07,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 21:01:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:01:07,772 INFO L225 Difference]: With dead ends: 5182 [2025-03-16 21:01:07,773 INFO L226 Difference]: Without dead ends: 3487 [2025-03-16 21:01:07,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:01:07,776 INFO L435 NwaCegarLoop]: 1757 mSDtfsCounter, 2579 mSDsluCounter, 5156 mSDsCounter, 0 mSdLazyCounter, 3694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 6913 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:01:07,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 6913 Invalid, 3695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3694 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 21:01:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2025-03-16 21:01:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 1887. [2025-03-16 21:01:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1886 states have (on average 1.4968186638388123) internal successors, (2823), 1886 states have internal predecessors, (2823), 0 states have call successors, (0), 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:01:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2823 transitions. [2025-03-16 21:01:07,814 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2823 transitions. Word has length 110 [2025-03-16 21:01:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:01:07,814 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2823 transitions. [2025-03-16 21:01:07,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:01:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2823 transitions. [2025-03-16 21:01:07,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 21:01:07,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:01:07,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:01:07,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:01:07,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:01:07,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:01:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1287937286, now seen corresponding path program 1 times [2025-03-16 21:01:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:01:07,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024796680] [2025-03-16 21:01:07,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:01:07,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:01:07,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 21:01:07,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 21:01:07,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:01:07,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:01:08,041 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:01:08,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:01:08,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024796680] [2025-03-16 21:01:08,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024796680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:01:08,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:01:08,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:01:08,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165944559] [2025-03-16 21:01:08,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:01:08,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:01:08,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:01:08,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:01:08,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:01:08,043 INFO L87 Difference]: Start difference. First operand 1887 states and 2823 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:01:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:01:09,697 INFO L93 Difference]: Finished difference Result 3582 states and 5360 transitions. [2025-03-16 21:01:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:01:09,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 21:01:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:01:09,703 INFO L225 Difference]: With dead ends: 3582 [2025-03-16 21:01:09,703 INFO L226 Difference]: Without dead ends: 1887 [2025-03-16 21:01:09,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:01:09,707 INFO L435 NwaCegarLoop]: 1749 mSDtfsCounter, 2593 mSDsluCounter, 3488 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2593 SdHoareTripleChecker+Valid, 5237 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:01:09,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2593 Valid, 5237 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 21:01:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2025-03-16 21:01:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1887. [2025-03-16 21:01:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1886 states have (on average 1.494697773064687) internal successors, (2819), 1886 states have internal predecessors, (2819), 0 states have call successors, (0), 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:01:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2819 transitions. [2025-03-16 21:01:09,735 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2819 transitions. Word has length 111 [2025-03-16 21:01:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:01:09,735 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2819 transitions. [2025-03-16 21:01:09,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:01:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2819 transitions. [2025-03-16 21:01:09,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 21:01:09,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:01:09,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:01:09,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:01:09,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:01:09,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:01:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash -498027634, now seen corresponding path program 1 times [2025-03-16 21:01:09,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:01:09,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102456052] [2025-03-16 21:01:09,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:01:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:01:09,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 21:01:09,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 21:01:09,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:01:09,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:01:09,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 21:01:09,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 21:01:09,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 21:01:09,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:01:09,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:01:09,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 21:01:09,890 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 21:01:09,890 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:01:09,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:01:09,894 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:01:09,959 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:01:09,977 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:01:09,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:01:09 BoogieIcfgContainer [2025-03-16 21:01:09,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:01:09,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:01:09,980 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:01:09,981 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:01:09,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:01:00" (3/4) ... [2025-03-16 21:01:09,984 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 21:01:09,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:01:09,985 INFO L158 Benchmark]: Toolchain (without parser) took 15913.88ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 122.1MB in the beginning and 222.8MB in the end (delta: -100.7MB). Peak memory consumption was 275.1MB. Max. memory is 16.1GB. [2025-03-16 21:01:09,986 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:01:09,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.44ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 52.6MB in the end (delta: 69.4MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-16 21:01:09,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 415.32ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 52.6MB in the beginning and 61.9MB in the end (delta: -9.3MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. [2025-03-16 21:01:09,987 INFO L158 Benchmark]: Boogie Preprocessor took 513.35ms. Allocated memory was 176.2MB in the beginning and 419.4MB in the end (delta: 243.3MB). Free memory was 61.9MB in the beginning and 280.7MB in the end (delta: -218.8MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2025-03-16 21:01:09,987 INFO L158 Benchmark]: IcfgBuilder took 4898.01ms. Allocated memory was 419.4MB in the beginning and 838.9MB in the end (delta: 419.4MB). Free memory was 280.7MB in the beginning and 373.7MB in the end (delta: -93.0MB). Peak memory consumption was 353.2MB. Max. memory is 16.1GB. [2025-03-16 21:01:09,987 INFO L158 Benchmark]: TraceAbstraction took 9557.78ms. Allocated memory was 838.9MB in the beginning and 536.9MB in the end (delta: -302.0MB). Free memory was 373.7MB in the beginning and 222.9MB in the end (delta: 150.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:01:09,988 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 536.9MB. Free memory was 222.9MB in the beginning and 222.8MB in the end (delta: 72.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:01:09,989 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.13ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.44ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 52.6MB in the end (delta: 69.4MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 415.32ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 52.6MB in the beginning and 61.9MB in the end (delta: -9.3MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 513.35ms. Allocated memory was 176.2MB in the beginning and 419.4MB in the end (delta: 243.3MB). Free memory was 61.9MB in the beginning and 280.7MB in the end (delta: -218.8MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * IcfgBuilder took 4898.01ms. Allocated memory was 419.4MB in the beginning and 838.9MB in the end (delta: 419.4MB). Free memory was 280.7MB in the beginning and 373.7MB in the end (delta: -93.0MB). Peak memory consumption was 353.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9557.78ms. Allocated memory was 838.9MB in the beginning and 536.9MB in the end (delta: -302.0MB). Free memory was 373.7MB in the beginning and 222.9MB in the end (delta: 150.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 536.9MB. Free memory was 222.9MB in the beginning and 222.8MB in the end (delta: 72.4kB). 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 231, overapproximation of bitwiseAnd at line 229. 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_4 var_63 = 1; [L41] const SORT_4 var_64 = 0; [L42] const SORT_2 var_74 = 0; [L43] const SORT_2 var_76 = 1; [L44] const SORT_3 var_91 = 0; [L45] const SORT_4 var_227 = 3; [L46] const SORT_2 var_239 = 3; [L47] const SORT_4 var_241 = 6; [L48] const SORT_4 var_343 = 2; [L50] SORT_1 input_73; [L51] SORT_1 input_75; [L52] SORT_1 input_80; [L53] SORT_1 input_81; [L54] SORT_1 input_85; [L55] SORT_1 input_86; [L56] SORT_1 input_90; [L57] SORT_1 input_98; [L58] SORT_1 input_105; [L59] SORT_1 input_112; [L60] SORT_1 input_116; [L61] SORT_1 input_117; [L62] SORT_1 input_131; [L63] SORT_1 input_135; [L64] SORT_1 input_136; [L65] SORT_1 input_150; [L66] SORT_1 input_154; [L67] SORT_1 input_155; [L68] SORT_1 input_176; [L69] SORT_1 input_179; [L70] SORT_1 input_195; [L71] SORT_1 input_198; [L72] SORT_1 input_214; [L73] SORT_1 input_217; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L75] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L76] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L77] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L78] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L79] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L80] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L81] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L82] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L83] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L84] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L85] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L86] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L87] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L88] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L89] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L90] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L91] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L92] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L93] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L94] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L95] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L96] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L97] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L98] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L99] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L100] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L101] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L101] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=6, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L102] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] SORT_2 init_7_arg_1 = var_5; [L105] state_6 = init_7_arg_1 [L106] SORT_2 init_9_arg_1 = var_5; [L107] state_8 = init_9_arg_1 [L108] SORT_2 init_11_arg_1 = var_5; [L109] state_10 = init_11_arg_1 [L110] SORT_2 init_13_arg_1 = var_5; [L111] state_12 = init_13_arg_1 [L112] SORT_2 init_15_arg_1 = var_5; [L113] state_14 = init_15_arg_1 [L114] SORT_2 init_17_arg_1 = var_5; [L115] state_16 = init_17_arg_1 [L116] SORT_2 init_19_arg_1 = var_5; [L117] state_18 = init_19_arg_1 [L118] SORT_2 init_21_arg_1 = var_5; [L119] state_20 = init_21_arg_1 [L120] SORT_2 init_23_arg_1 = var_5; [L121] state_22 = init_23_arg_1 [L122] SORT_2 init_25_arg_1 = var_5; [L123] state_24 = init_25_arg_1 [L124] SORT_2 init_27_arg_1 = var_5; [L125] state_26 = init_27_arg_1 [L126] SORT_2 init_29_arg_1 = var_5; [L127] state_28 = init_29_arg_1 [L128] SORT_1 init_32_arg_1 = var_30; [L129] state_31 = init_32_arg_1 [L130] SORT_1 init_34_arg_1 = var_30; [L131] state_33 = init_34_arg_1 [L132] SORT_1 init_36_arg_1 = var_30; [L133] state_35 = init_36_arg_1 [L134] SORT_1 init_38_arg_1 = var_30; [L135] state_37 = init_38_arg_1 [L136] SORT_1 init_40_arg_1 = var_30; [L137] state_39 = init_40_arg_1 [L138] SORT_1 init_42_arg_1 = var_30; [L139] state_41 = init_42_arg_1 [L140] SORT_1 init_44_arg_1 = var_30; [L141] state_43 = init_44_arg_1 [L142] SORT_1 init_46_arg_1 = var_30; [L143] state_45 = init_46_arg_1 [L144] SORT_1 init_48_arg_1 = var_30; [L145] state_47 = init_48_arg_1 [L146] SORT_1 init_50_arg_1 = var_30; [L147] state_49 = init_50_arg_1 [L148] SORT_1 init_52_arg_1 = var_30; [L149] state_51 = init_52_arg_1 [L150] SORT_1 init_54_arg_1 = var_30; [L151] state_53 = init_54_arg_1 [L152] SORT_1 init_56_arg_1 = var_30; [L153] state_55 = init_56_arg_1 [L154] SORT_1 init_58_arg_1 = var_30; [L155] state_57 = init_58_arg_1 [L156] SORT_1 init_60_arg_1 = var_30; [L157] state_59 = init_60_arg_1 [L158] SORT_1 init_62_arg_1 = var_30; [L159] state_61 = init_62_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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L162] input_73 = __VERIFIER_nondet_uchar() [L163] EXPR input_73 & 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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L163] input_73 = input_73 & mask_SORT_1 [L164] input_75 = __VERIFIER_nondet_uchar() [L165] EXPR input_75 & mask_SORT_1 VAL [input_73=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L165] input_75 = input_75 & mask_SORT_1 [L166] input_80 = __VERIFIER_nondet_uchar() [L167] EXPR input_80 & mask_SORT_1 VAL [input_73=0, input_75=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L167] input_80 = input_80 & mask_SORT_1 [L168] input_81 = __VERIFIER_nondet_uchar() [L169] EXPR input_81 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L169] input_81 = input_81 & mask_SORT_1 [L170] input_85 = __VERIFIER_nondet_uchar() [L171] EXPR input_85 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L171] input_85 = input_85 & mask_SORT_1 [L172] input_86 = __VERIFIER_nondet_uchar() [L173] EXPR input_86 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L173] input_86 = input_86 & mask_SORT_1 [L174] input_90 = __VERIFIER_nondet_uchar() [L175] EXPR input_90 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L175] input_90 = input_90 & mask_SORT_1 [L176] input_98 = __VERIFIER_nondet_uchar() [L177] EXPR input_98 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L177] input_98 = input_98 & mask_SORT_1 [L178] input_105 = __VERIFIER_nondet_uchar() [L179] EXPR input_105 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L179] input_105 = input_105 & mask_SORT_1 [L180] input_112 = __VERIFIER_nondet_uchar() [L181] EXPR input_112 & mask_SORT_1 VAL [input_105=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L181] input_112 = input_112 & mask_SORT_1 [L182] input_116 = __VERIFIER_nondet_uchar() [L183] EXPR input_116 & mask_SORT_1 VAL [input_105=0, input_112=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L183] input_116 = input_116 & mask_SORT_1 [L184] input_117 = __VERIFIER_nondet_uchar() [L185] EXPR input_117 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L185] input_117 = input_117 & mask_SORT_1 [L186] input_131 = __VERIFIER_nondet_uchar() [L187] EXPR input_131 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L187] input_131 = input_131 & mask_SORT_1 [L188] input_135 = __VERIFIER_nondet_uchar() [L189] EXPR input_135 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L189] input_135 = input_135 & mask_SORT_1 [L190] input_136 = __VERIFIER_nondet_uchar() [L191] EXPR input_136 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L191] input_136 = input_136 & mask_SORT_1 [L192] input_150 = __VERIFIER_nondet_uchar() [L193] EXPR input_150 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L193] input_150 = input_150 & mask_SORT_1 [L194] input_154 = __VERIFIER_nondet_uchar() [L195] EXPR input_154 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L195] input_154 = input_154 & mask_SORT_1 [L196] input_155 = __VERIFIER_nondet_uchar() [L197] EXPR input_155 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L197] input_155 = input_155 & mask_SORT_1 [L198] input_176 = __VERIFIER_nondet_uchar() [L199] input_179 = __VERIFIER_nondet_uchar() [L200] input_195 = __VERIFIER_nondet_uchar() [L201] input_198 = __VERIFIER_nondet_uchar() [L202] input_214 = __VERIFIER_nondet_uchar() [L203] input_217 = __VERIFIER_nondet_uchar() [L206] SORT_1 var_65_arg_0 = state_39; [L207] SORT_4 var_65_arg_1 = var_63; [L208] SORT_4 var_65_arg_2 = var_64; [L209] SORT_4 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L210] SORT_1 var_66_arg_0 = state_49; [L211] SORT_4 var_66_arg_1 = var_63; [L212] SORT_4 var_66_arg_2 = var_64; [L213] SORT_4 var_66 = var_66_arg_0 ? var_66_arg_1 : var_66_arg_2; [L214] SORT_4 var_67_arg_0 = var_65; [L215] SORT_4 var_67_arg_1 = var_66; [L216] SORT_4 var_67 = var_67_arg_0 + var_67_arg_1; [L217] SORT_1 var_68_arg_0 = state_59; [L218] SORT_4 var_68_arg_1 = var_63; [L219] SORT_4 var_68_arg_2 = var_64; [L220] SORT_4 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L221] SORT_4 var_69_arg_0 = var_67; [L222] SORT_4 var_69_arg_1 = var_68; [L223] SORT_4 var_69 = var_69_arg_0 + var_69_arg_1; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_69=0, var_74=0, var_76=1, var_91=0] [L224] EXPR var_69 & mask_SORT_4 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L224] var_69 = var_69 & mask_SORT_4 [L225] SORT_4 var_70_arg_0 = var_69; [L226] SORT_4 var_70_arg_1 = var_63; [L227] SORT_1 var_70 = var_70_arg_0 <= var_70_arg_1; [L228] SORT_1 var_71_arg_0 = ~state_61; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_70=1, var_71_arg_0=-1, var_74=0, var_76=1, var_91=0] [L229] EXPR var_71_arg_0 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_70=1, var_74=0, var_76=1, var_91=0] [L229] var_71_arg_0 = var_71_arg_0 & mask_SORT_1 [L230] SORT_1 var_71_arg_1 = ~var_70; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_71_arg_0=1, var_71_arg_1=-2, var_74=0, var_76=1, var_91=0] [L231] EXPR var_71_arg_1 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_71_arg_0=1, var_74=0, var_76=1, var_91=0] [L231] var_71_arg_1 = var_71_arg_1 & mask_SORT_1 [L232] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L232] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L233] EXPR var_71 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=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_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=6, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L233] var_71 = var_71 & mask_SORT_1 [L234] SORT_1 bad_72_arg_0 = var_71; [L235] CALL __VERIFIER_assert(!(bad_72_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1800 locations, 2697 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5175 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5175 mSDsluCounter, 39039 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26557 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11959 IncrementalHoareTripleChecker+Invalid, 11961 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 12482 mSDtfsCounter, 11959 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1887occurred 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1604 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 645 ConstructedInterpolants, 0 QuantifiedInterpolants, 1496 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:01:10,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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.bakery.4.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 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:01:11,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:01:12,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 21:01:12,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:01:12,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:01:12,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:01:12,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:01:12,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:01:12,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:01:12,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:01:12,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:01:12,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:01:12,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:01:12,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:01:12,024 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:01:12,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:01:12,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:01:12,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:01:12,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:01:12,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:01:12,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:01:12,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 21:01:12,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:01:12,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:01:12,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:01:12,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:01:12,026 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 -> 8f99c9b906e0ce9dfb5a1fdac7e796a2c68c541e986f60427db8a196999b6c01 [2025-03-16 21:01:12,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:01:12,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:01:12,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:01:12,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:01:12,295 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:01:12,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-16 21:01:13,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f616fa2/7bbf99fa010e4d75a0bb7558f86f8916/FLAGdceee655d [2025-03-16 21:01:13,812 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:01:13,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-16 21:01:13,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f616fa2/7bbf99fa010e4d75a0bb7558f86f8916/FLAGdceee655d [2025-03-16 21:01:13,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f616fa2/7bbf99fa010e4d75a0bb7558f86f8916 [2025-03-16 21:01:13,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:01:13,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:01:13,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:01:13,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:01:13,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:01:13,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:01:13" (1/1) ... [2025-03-16 21:01:13,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efbf561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:13, skipping insertion in model container [2025-03-16 21:01:13,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:01:13" (1/1) ... [2025-03-16 21:01:13,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:01:14,026 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.bakery.4.prop1-func-interl.c[1173,1186] [2025-03-16 21:01:14,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:01:14,247 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:01:14,254 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.bakery.4.prop1-func-interl.c[1173,1186] [2025-03-16 21:01:14,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:01:14,343 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:01:14,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14 WrapperNode [2025-03-16 21:01:14,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:01:14,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:01:14,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:01:14,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:01:14,349 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:01:14" (1/1) ... [2025-03-16 21:01:14,386 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:01:14" (1/1) ... [2025-03-16 21:01:14,480 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1649 [2025-03-16 21:01:14,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:01:14,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:01:14,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:01:14,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:01:14,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (1/1) ... [2025-03-16 21:01:14,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (1/1) ... [2025-03-16 21:01:14,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (1/1) ... [2025-03-16 21:01:14,542 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:01:14,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (1/1) ... [2025-03-16 21:01:14,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (1/1) ... [2025-03-16 21:01:14,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (1/1) ... [2025-03-16 21:01:14,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (1/1) ... [2025-03-16 21:01:14,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (1/1) ... [2025-03-16 21:01:14,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (1/1) ... [2025-03-16 21:01:14,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:01:14,602 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:01:14,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:01:14,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:01:14,602 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (1/1) ... [2025-03-16 21:01:14,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:01:14,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:01:14,627 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:01:14,630 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:01:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:01:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 21:01:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:01:14,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:01:14,849 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:01:14,850 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:01:15,890 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-03-16 21:01:15,890 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:01:15,897 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:01:15,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:01:15,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:01:15 BoogieIcfgContainer [2025-03-16 21:01:15,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:01:15,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:01:15,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:01:15,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:01:15,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:01:13" (1/3) ... [2025-03-16 21:01:15,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b33d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:01:15, skipping insertion in model container [2025-03-16 21:01:15,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:01:14" (2/3) ... [2025-03-16 21:01:15,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b33d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:01:15, skipping insertion in model container [2025-03-16 21:01:15,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:01:15" (3/3) ... [2025-03-16 21:01:15,905 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c [2025-03-16 21:01:15,916 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:01:15,918 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.bakery.4.prop1-func-interl.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:01:15,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:01:15,962 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;@3f5515ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:01:15,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:01:15,966 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:01:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 21:01:15,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:01:15,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 21:01:15,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:01:15,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:01:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 21:01:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:01:15,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993737574] [2025-03-16 21:01:15,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:01:15,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:01:15,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:01:15,989 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:01:15,991 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:01:16,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 21:01:16,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 21:01:16,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:01:16,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:01:16,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-16 21:01:16,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:01:16,541 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:01:16,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:01:16,541 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:01:16,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993737574] [2025-03-16 21:01:16,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993737574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:01:16,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:01:16,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:01:16,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143449886] [2025-03-16 21:01:16,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:01:16,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:01:16,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:01:16,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:01:16,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:01:16,564 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:01:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:01:16,714 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 21:01:16,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:01:16,716 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:01:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:01:16,723 INFO L225 Difference]: With dead ends: 16 [2025-03-16 21:01:16,723 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 21:01:16,725 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:01:16,726 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:01:16,726 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.1s Time] [2025-03-16 21:01:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 21:01:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 21:01:16,745 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:01:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 21:01:16,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 21:01:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:01:16,749 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 21:01:16,749 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:01:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 21:01:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 21:01:16,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:01:16,749 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 21:01:16,757 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:01:16,954 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:01:16,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:01:16,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:01:16,955 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 21:01:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:01:16,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88475538] [2025-03-16 21:01:16,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:01:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:01:16,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:01:16,958 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:01:16,959 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:01:17,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 21:01:17,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 21:01:17,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:01:17,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:01:17,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-16 21:01:17,367 INFO L279 TraceCheckSpWp]: Computing forward predicates...