./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.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.anderson.2.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:51:36,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:51:37,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 20:51:37,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:51:37,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:51:37,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:51:37,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:51:37,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:51:37,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:51:37,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:51:37,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:51:37,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:51:37,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:51:37,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:51:37,042 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:51:37,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:51:37,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:51:37,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:51:37,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:51:37,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:51:37,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:51:37,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:51:37,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:51:37,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:51:37,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:51:37,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:51:37,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:51:37,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:51:37,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:51:37,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:51:37,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:51:37,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:51:37,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:51:37,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:51:37,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:51:37,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:51:37,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:51:37,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:51:37,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:51:37,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:51:37,044 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 -> 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 [2025-03-16 20:51:37,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:51:37,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:51:37,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:51:37,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:51:37,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:51:37,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2025-03-16 20:51:38,416 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f1c999/d435e926a48f4e60b63157083f2879c7/FLAGdd505d16e [2025-03-16 20:51:38,730 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:51:38,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2025-03-16 20:51:38,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f1c999/d435e926a48f4e60b63157083f2879c7/FLAGdd505d16e [2025-03-16 20:51:38,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f1c999/d435e926a48f4e60b63157083f2879c7 [2025-03-16 20:51:38,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:51:38,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:51:38,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:51:38,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:51:38,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:51:38,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:51:38" (1/1) ... [2025-03-16 20:51:38,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f4b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:38, skipping insertion in model container [2025-03-16 20:51:38,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:51:38" (1/1) ... [2025-03-16 20:51:39,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:51:39,153 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.anderson.2.prop1-func-interl.c[1175,1188] [2025-03-16 20:51:39,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:51:39,378 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:51:39,385 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.anderson.2.prop1-func-interl.c[1175,1188] [2025-03-16 20:51:39,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:51:39,480 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:51:39,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39 WrapperNode [2025-03-16 20:51:39,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:51:39,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:51:39,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:51:39,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:51:39,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:39,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:39,857 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4637 [2025-03-16 20:51:39,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:51:39,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:51:39,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:51:39,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:51:39,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:39,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:39,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:40,044 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 20:51:40,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:40,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:40,170 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:40,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:40,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:40,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:40,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:51:40,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:51:40,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:51:40,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:51:40,300 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (1/1) ... [2025-03-16 20:51:40,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:51:40,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:40,327 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 20:51:40,331 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 20:51:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:51:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:51:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:51:40,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:51:40,581 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:51:40,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:51:44,363 INFO L? ?]: Removed 2536 outVars from TransFormulas that were not future-live. [2025-03-16 20:51:44,363 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:51:44,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:51:44,512 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:51:44,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:51:44 BoogieIcfgContainer [2025-03-16 20:51:44,512 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:51:44,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:51:44,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:51:44,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:51:44,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:51:38" (1/3) ... [2025-03-16 20:51:44,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272627b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:51:44, skipping insertion in model container [2025-03-16 20:51:44,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:39" (2/3) ... [2025-03-16 20:51:44,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272627b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:51:44, skipping insertion in model container [2025-03-16 20:51:44,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:51:44" (3/3) ... [2025-03-16 20:51:44,519 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.2.prop1-func-interl.c [2025-03-16 20:51:44,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:51:44,532 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.anderson.2.prop1-func-interl.c that has 1 procedures, 1630 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 20:51:44,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:51:44,598 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;@6a4a1ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:51:44,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 20:51:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 1630 states, 1628 states have (on average 1.5042997542997543) internal successors, (2449), 1629 states have internal predecessors, (2449), 0 states have call successors, (0), 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 20:51:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:51:44,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:44,615 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] [2025-03-16 20:51:44,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:44,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1512252455, now seen corresponding path program 1 times [2025-03-16 20:51:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:44,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498808164] [2025-03-16 20:51:44,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:44,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:51:44,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:51:44,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:44,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:45,310 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 20:51:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:45,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498808164] [2025-03-16 20:51:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498808164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:45,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:45,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:45,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912778325] [2025-03-16 20:51:45,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:45,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:45,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:45,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:45,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:45,342 INFO L87 Difference]: Start difference. First operand has 1630 states, 1628 states have (on average 1.5042997542997543) internal successors, (2449), 1629 states have internal predecessors, (2449), 0 states have call successors, (0), 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 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 20:51:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:46,129 INFO L93 Difference]: Finished difference Result 3167 states and 4761 transitions. [2025-03-16 20:51:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 20:51:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:46,142 INFO L225 Difference]: With dead ends: 3167 [2025-03-16 20:51:46,142 INFO L226 Difference]: Without dead ends: 1630 [2025-03-16 20:51:46,147 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 20:51:46,149 INFO L435 NwaCegarLoop]: 2042 mSDtfsCounter, 0 mSDsluCounter, 4079 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6121 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:46,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6121 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:51:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2025-03-16 20:51:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2025-03-16 20:51:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1629 states have (on average 1.5027624309392265) internal successors, (2448), 1629 states have internal predecessors, (2448), 0 states have call successors, (0), 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 20:51:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2448 transitions. [2025-03-16 20:51:46,228 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2448 transitions. Word has length 78 [2025-03-16 20:51:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:46,228 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2448 transitions. [2025-03-16 20:51:46,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 20:51:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2448 transitions. [2025-03-16 20:51:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 20:51:46,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:46,230 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] [2025-03-16 20:51:46,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:51:46,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:46,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:46,231 INFO L85 PathProgramCache]: Analyzing trace with hash -360132425, now seen corresponding path program 1 times [2025-03-16 20:51:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:46,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511305761] [2025-03-16 20:51:46,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:46,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:46,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 20:51:46,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 20:51:46,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:46,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:46,477 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 20:51:46,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:46,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511305761] [2025-03-16 20:51:46,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511305761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:46,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:46,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:46,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007797979] [2025-03-16 20:51:46,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:46,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:46,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:46,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:46,480 INFO L87 Difference]: Start difference. First operand 1630 states and 2448 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 20:51:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:47,093 INFO L93 Difference]: Finished difference Result 3169 states and 4760 transitions. [2025-03-16 20:51:47,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:47,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-16 20:51:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:47,099 INFO L225 Difference]: With dead ends: 3169 [2025-03-16 20:51:47,099 INFO L226 Difference]: Without dead ends: 1632 [2025-03-16 20:51:47,102 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 20:51:47,103 INFO L435 NwaCegarLoop]: 2042 mSDtfsCounter, 0 mSDsluCounter, 4076 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6118 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:47,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6118 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-03-16 20:51:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1632. [2025-03-16 20:51:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1631 states have (on average 1.502145922746781) internal successors, (2450), 1631 states have internal predecessors, (2450), 0 states have call successors, (0), 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 20:51:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2450 transitions. [2025-03-16 20:51:47,130 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2450 transitions. Word has length 79 [2025-03-16 20:51:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:47,131 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 2450 transitions. [2025-03-16 20:51:47,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 20:51:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2450 transitions. [2025-03-16 20:51:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 20:51:47,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:47,134 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] [2025-03-16 20:51:47,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:51:47,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:47,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash -642658782, now seen corresponding path program 1 times [2025-03-16 20:51:47,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:47,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812148700] [2025-03-16 20:51:47,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:47,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:47,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 20:51:47,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 20:51:47,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:47,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:47,324 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 20:51:47,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:47,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812148700] [2025-03-16 20:51:47,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812148700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:47,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:47,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:47,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11300844] [2025-03-16 20:51:47,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:47,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:51:47,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:47,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:51:47,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:51:47,326 INFO L87 Difference]: Start difference. First operand 1632 states and 2450 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 20:51:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:47,954 INFO L93 Difference]: Finished difference Result 3177 states and 4770 transitions. [2025-03-16 20:51:47,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:47,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-16 20:51:47,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:47,959 INFO L225 Difference]: With dead ends: 3177 [2025-03-16 20:51:47,959 INFO L226 Difference]: Without dead ends: 1638 [2025-03-16 20:51:47,961 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 20:51:47,962 INFO L435 NwaCegarLoop]: 2042 mSDtfsCounter, 4 mSDsluCounter, 4071 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6113 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:47,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6113 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:51:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-03-16 20:51:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2025-03-16 20:51:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1637 states have (on average 1.5015271838729383) internal successors, (2458), 1637 states have internal predecessors, (2458), 0 states have call successors, (0), 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 20:51:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2458 transitions. [2025-03-16 20:51:47,987 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2458 transitions. Word has length 80 [2025-03-16 20:51:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:47,987 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2458 transitions. [2025-03-16 20:51:47,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 20:51:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2458 transitions. [2025-03-16 20:51:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 20:51:47,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:47,988 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] [2025-03-16 20:51:47,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:51:47,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:47,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:47,989 INFO L85 PathProgramCache]: Analyzing trace with hash 631491873, now seen corresponding path program 1 times [2025-03-16 20:51:47,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:47,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601002270] [2025-03-16 20:51:47,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:48,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 20:51:48,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 20:51:48,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:48,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:48,142 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 20:51:48,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:48,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601002270] [2025-03-16 20:51:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601002270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:48,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:48,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:48,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010435747] [2025-03-16 20:51:48,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:48,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:48,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:48,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:48,143 INFO L87 Difference]: Start difference. First operand 1638 states and 2458 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 20:51:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:48,734 INFO L93 Difference]: Finished difference Result 3187 states and 4782 transitions. [2025-03-16 20:51:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:51:48,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-16 20:51:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:48,739 INFO L225 Difference]: With dead ends: 3187 [2025-03-16 20:51:48,739 INFO L226 Difference]: Without dead ends: 1642 [2025-03-16 20:51:48,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:48,742 INFO L435 NwaCegarLoop]: 2042 mSDtfsCounter, 0 mSDsluCounter, 4071 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6113 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:48,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6113 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:51:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2025-03-16 20:51:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1638. [2025-03-16 20:51:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1637 states have (on average 1.5015271838729383) internal successors, (2458), 1637 states have internal predecessors, (2458), 0 states have call successors, (0), 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 20:51:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2458 transitions. [2025-03-16 20:51:48,765 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2458 transitions. Word has length 81 [2025-03-16 20:51:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:48,765 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2458 transitions. [2025-03-16 20:51:48,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 20:51:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2458 transitions. [2025-03-16 20:51:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:51:48,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:48,766 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] [2025-03-16 20:51:48,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:51:48,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:48,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash -10223331, now seen corresponding path program 1 times [2025-03-16 20:51:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802773492] [2025-03-16 20:51:48,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:48,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:51:48,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:51:48,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:48,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:49,121 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 20:51:49,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:49,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802773492] [2025-03-16 20:51:49,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802773492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:49,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:49,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:51:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933072606] [2025-03-16 20:51:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:51:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:49,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:51:49,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:51:49,123 INFO L87 Difference]: Start difference. First operand 1638 states and 2458 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 20:51:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:50,808 INFO L93 Difference]: Finished difference Result 3195 states and 4795 transitions. [2025-03-16 20:51:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:51:50,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-16 20:51:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:50,813 INFO L225 Difference]: With dead ends: 3195 [2025-03-16 20:51:50,814 INFO L226 Difference]: Without dead ends: 1650 [2025-03-16 20:51:50,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:51:50,816 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 2393 mSDsluCounter, 4746 mSDsCounter, 0 mSdLazyCounter, 3451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 6332 SdHoareTripleChecker+Invalid, 3452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:50,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 6332 Invalid, 3452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3451 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 20:51:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2025-03-16 20:51:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1648. [2025-03-16 20:51:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.4996964177292047) internal successors, (2470), 1647 states have internal predecessors, (2470), 0 states have call successors, (0), 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 20:51:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2470 transitions. [2025-03-16 20:51:50,838 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2470 transitions. Word has length 82 [2025-03-16 20:51:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:50,838 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2470 transitions. [2025-03-16 20:51:50,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 20:51:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2470 transitions. [2025-03-16 20:51:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 20:51:50,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:50,839 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] [2025-03-16 20:51:50,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:51:50,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:50,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash 611818535, now seen corresponding path program 1 times [2025-03-16 20:51:50,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:50,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992808568] [2025-03-16 20:51:50,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:50,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 20:51:50,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 20:51:50,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:50,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:51:51,045 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 20:51:51,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:51:51,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992808568] [2025-03-16 20:51:51,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992808568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:51:51,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:51:51,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:51:51,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566878256] [2025-03-16 20:51:51,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:51:51,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:51:51,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:51:51,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:51:51,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:51:51,048 INFO L87 Difference]: Start difference. First operand 1648 states and 2470 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 20:51:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:51:52,810 INFO L93 Difference]: Finished difference Result 4739 states and 7105 transitions. [2025-03-16 20:51:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:51:52,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-16 20:51:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:51:52,818 INFO L225 Difference]: With dead ends: 4739 [2025-03-16 20:51:52,818 INFO L226 Difference]: Without dead ends: 3184 [2025-03-16 20:51:52,819 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 20:51:52,821 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 2359 mSDsluCounter, 4719 mSDsCounter, 0 mSdLazyCounter, 3323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2359 SdHoareTripleChecker+Valid, 6322 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:52,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2359 Valid, 6322 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3323 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 20:51:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2025-03-16 20:51:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 1694. [2025-03-16 20:51:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1693 states have (on average 1.4979326639102186) internal successors, (2536), 1693 states have internal predecessors, (2536), 0 states have call successors, (0), 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 20:51:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2536 transitions. [2025-03-16 20:51:52,851 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2536 transitions. Word has length 83 [2025-03-16 20:51:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:51:52,851 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 2536 transitions. [2025-03-16 20:51:52,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 20:51:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2536 transitions. [2025-03-16 20:51:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 20:51:52,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:52,852 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] [2025-03-16 20:51:52,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:51:52,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:52,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1566142938, now seen corresponding path program 1 times [2025-03-16 20:51:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:51:52,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029277186] [2025-03-16 20:51:52,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:51:52,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:51:52,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:51:52,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:52,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 20:51:52,901 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 20:51:52,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:51:52,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:51:52,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:51:52,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 20:51:52,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 20:51:52,982 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 20:51:52,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 20:51:52,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:51:52,988 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:51:53,036 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 20:51:53,048 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 20:51:53,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 08:51:53 BoogieIcfgContainer [2025-03-16 20:51:53,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 20:51:53,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 20:51:53,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 20:51:53,055 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 20:51:53,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:51:44" (3/4) ... [2025-03-16 20:51:53,057 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 20:51:53,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 20:51:53,058 INFO L158 Benchmark]: Toolchain (without parser) took 14070.59ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 119.9MB in the beginning and 257.1MB in the end (delta: -137.2MB). Peak memory consumption was 266.6MB. Max. memory is 16.1GB. [2025-03-16 20:51:53,059 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 20:51:53,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.71ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 60.2MB in the end (delta: 59.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-16 20:51:53,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 374.51ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 56.4MB in the end (delta: 3.7MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. [2025-03-16 20:51:53,059 INFO L158 Benchmark]: Boogie Preprocessor took 439.25ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 56.4MB in the beginning and 280.4MB in the end (delta: -224.0MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2025-03-16 20:51:53,060 INFO L158 Benchmark]: IcfgBuilder took 4213.39ms. Allocated memory is still 411.0MB. Free memory was 280.4MB in the beginning and 157.1MB in the end (delta: 123.3MB). Peak memory consumption was 214.9MB. Max. memory is 16.1GB. [2025-03-16 20:51:53,060 INFO L158 Benchmark]: TraceAbstraction took 8540.15ms. Allocated memory was 411.0MB in the beginning and 570.4MB in the end (delta: 159.4MB). Free memory was 157.1MB in the beginning and 257.2MB in the end (delta: -100.1MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2025-03-16 20:51:53,061 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 570.4MB. Free memory was 257.2MB in the beginning and 257.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 20:51:53,061 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.22ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.71ms. Allocated memory is still 167.8MB. Free memory was 119.9MB in the beginning and 60.2MB in the end (delta: 59.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 374.51ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 56.4MB in the end (delta: 3.7MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 439.25ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 56.4MB in the beginning and 280.4MB in the end (delta: -224.0MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * IcfgBuilder took 4213.39ms. Allocated memory is still 411.0MB. Free memory was 280.4MB in the beginning and 157.1MB in the end (delta: 123.3MB). Peak memory consumption was 214.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8540.15ms. Allocated memory was 411.0MB in the beginning and 570.4MB in the end (delta: 159.4MB). Free memory was 157.1MB in the beginning and 257.2MB in the end (delta: -100.1MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 570.4MB. Free memory was 257.2MB in the beginning and 257.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 194, overapproximation of bitwiseAnd at line 192. 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_20 = 0; [L40] const SORT_4 var_53 = 1; [L41] const SORT_4 var_54 = 0; [L42] const SORT_2 var_63 = 1; [L43] const SORT_3 var_65 = 0; [L44] const SORT_4 var_68 = 3; [L45] const SORT_2 var_72 = 0; [L46] const SORT_4 var_122 = 2; [L47] const SORT_2 var_125 = 2; [L49] SORT_1 input_64; [L50] SORT_1 input_74; [L51] SORT_1 input_76; [L52] SORT_1 input_83; [L53] SORT_1 input_85; [L54] SORT_1 input_92; [L55] SORT_1 input_143; [L56] SORT_1 input_147; [L57] SORT_1 input_150; [L58] SORT_1 input_151; [L59] SORT_1 input_152; [L60] SORT_1 input_153; [L61] SORT_1 input_161; [L62] SORT_1 input_167; [L63] SORT_1 input_173; [L64] SORT_1 input_188; [L65] SORT_1 input_206; [L66] SORT_1 input_224; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L68] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L69] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L70] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L71] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L72] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L73] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L74] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L75] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L76] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L78] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L79] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L80] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L81] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L82] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L83] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L84] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L85] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L86] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L87] SORT_1 state_45 = __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, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L88] SORT_1 state_47 = __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, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L89] SORT_1 state_49 = __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, msb_SORT_4=2147483648, var_122=2, var_125=2, var_20=0, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_72=0] [L90] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_2 init_7_arg_1 = var_5; [L93] state_6 = init_7_arg_1 [L94] SORT_2 init_9_arg_1 = var_5; [L95] state_8 = init_9_arg_1 [L96] SORT_2 init_11_arg_1 = var_5; [L97] state_10 = init_11_arg_1 [L98] SORT_2 init_13_arg_1 = var_5; [L99] state_12 = init_13_arg_1 [L100] SORT_2 init_15_arg_1 = var_5; [L101] state_14 = init_15_arg_1 [L102] SORT_2 init_17_arg_1 = var_5; [L103] state_16 = init_17_arg_1 [L104] SORT_2 init_19_arg_1 = var_5; [L105] state_18 = init_19_arg_1 [L106] SORT_1 init_22_arg_1 = var_20; [L107] state_21 = init_22_arg_1 [L108] SORT_1 init_24_arg_1 = var_20; [L109] state_23 = init_24_arg_1 [L110] SORT_1 init_26_arg_1 = var_20; [L111] state_25 = init_26_arg_1 [L112] SORT_1 init_28_arg_1 = var_20; [L113] state_27 = init_28_arg_1 [L114] SORT_1 init_30_arg_1 = var_20; [L115] state_29 = init_30_arg_1 [L116] SORT_1 init_32_arg_1 = var_20; [L117] state_31 = init_32_arg_1 [L118] SORT_1 init_34_arg_1 = var_20; [L119] state_33 = init_34_arg_1 [L120] SORT_1 init_36_arg_1 = var_20; [L121] state_35 = init_36_arg_1 [L122] SORT_1 init_38_arg_1 = var_20; [L123] state_37 = init_38_arg_1 [L124] SORT_1 init_40_arg_1 = var_20; [L125] state_39 = init_40_arg_1 [L126] SORT_1 init_42_arg_1 = var_20; [L127] state_41 = init_42_arg_1 [L128] SORT_1 init_44_arg_1 = var_20; [L129] state_43 = init_44_arg_1 [L130] SORT_1 init_46_arg_1 = var_20; [L131] state_45 = init_46_arg_1 [L132] SORT_1 init_48_arg_1 = var_20; [L133] state_47 = init_48_arg_1 [L134] SORT_1 init_50_arg_1 = var_20; [L135] state_49 = init_50_arg_1 [L136] SORT_1 init_52_arg_1 = var_20; [L137] state_51 = init_52_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L140] input_64 = __VERIFIER_nondet_uchar() [L141] input_74 = __VERIFIER_nondet_uchar() [L142] input_76 = __VERIFIER_nondet_uchar() [L143] input_83 = __VERIFIER_nondet_uchar() [L144] input_85 = __VERIFIER_nondet_uchar() [L145] input_92 = __VERIFIER_nondet_uchar() [L146] input_143 = __VERIFIER_nondet_uchar() [L147] EXPR input_143 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L147] input_143 = input_143 & mask_SORT_1 [L148] input_147 = __VERIFIER_nondet_uchar() [L149] EXPR input_147 & mask_SORT_1 VAL [input_143=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L149] input_147 = input_147 & mask_SORT_1 [L150] input_150 = __VERIFIER_nondet_uchar() [L151] EXPR input_150 & mask_SORT_1 VAL [input_143=0, input_147=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L151] input_150 = input_150 & mask_SORT_1 [L152] input_151 = __VERIFIER_nondet_uchar() [L153] EXPR input_151 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L153] input_151 = input_151 & mask_SORT_1 [L154] input_152 = __VERIFIER_nondet_uchar() [L155] EXPR input_152 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L155] input_152 = input_152 & mask_SORT_1 [L156] input_153 = __VERIFIER_nondet_uchar() [L157] EXPR input_153 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L157] input_153 = input_153 & mask_SORT_1 [L158] input_161 = __VERIFIER_nondet_uchar() [L159] EXPR input_161 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L159] input_161 = input_161 & mask_SORT_1 [L160] input_167 = __VERIFIER_nondet_uchar() [L161] EXPR input_167 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L161] input_167 = input_167 & mask_SORT_1 [L162] input_173 = __VERIFIER_nondet_uchar() [L163] EXPR input_173 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L163] input_173 = input_173 & mask_SORT_1 [L164] input_188 = __VERIFIER_nondet_uchar() [L165] input_206 = __VERIFIER_nondet_uchar() [L166] input_224 = __VERIFIER_nondet_uchar() [L169] SORT_1 var_55_arg_0 = state_29; [L170] SORT_4 var_55_arg_1 = var_53; [L171] SORT_4 var_55_arg_2 = var_54; [L172] SORT_4 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L173] SORT_1 var_56_arg_0 = state_39; [L174] SORT_4 var_56_arg_1 = var_53; [L175] SORT_4 var_56_arg_2 = var_54; [L176] SORT_4 var_56 = var_56_arg_0 ? var_56_arg_1 : var_56_arg_2; [L177] SORT_4 var_57_arg_0 = var_55; [L178] SORT_4 var_57_arg_1 = var_56; [L179] SORT_4 var_57 = var_57_arg_0 + var_57_arg_1; [L180] SORT_1 var_58_arg_0 = state_49; [L181] SORT_4 var_58_arg_1 = var_53; [L182] SORT_4 var_58_arg_2 = var_54; [L183] SORT_4 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L184] SORT_4 var_59_arg_0 = var_57; [L185] SORT_4 var_59_arg_1 = var_58; [L186] SORT_4 var_59 = var_59_arg_0 + var_59_arg_1; VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_59=0, var_63=1, var_65=0, var_68=3, var_72=0] [L187] EXPR var_59 & mask_SORT_4 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L187] var_59 = var_59 & mask_SORT_4 [L188] SORT_4 var_60_arg_0 = var_59; [L189] SORT_4 var_60_arg_1 = var_53; [L190] SORT_1 var_60 = var_60_arg_0 <= var_60_arg_1; [L191] SORT_1 var_61_arg_0 = ~state_51; VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_60=1, var_61_arg_0=-1, var_63=1, var_65=0, var_68=3, var_72=0] [L192] EXPR var_61_arg_0 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_60=1, var_63=1, var_65=0, var_68=3, var_72=0] [L192] var_61_arg_0 = var_61_arg_0 & mask_SORT_1 [L193] SORT_1 var_61_arg_1 = ~var_60; VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_61_arg_0=1, var_61_arg_1=-2, var_63=1, var_65=0, var_68=3, var_72=0] [L194] EXPR var_61_arg_1 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_61_arg_0=1, var_63=1, var_65=0, var_68=3, var_72=0] [L194] var_61_arg_1 = var_61_arg_1 & mask_SORT_1 [L195] EXPR var_61_arg_0 & var_61_arg_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L195] SORT_1 var_61 = var_61_arg_0 & var_61_arg_1; [L196] EXPR var_61 & mask_SORT_1 VAL [input_143=0, input_147=0, input_150=0, input_151=0, input_152=0, input_153=0, input_161=0, input_167=0, input_173=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=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_6=0, state_8=0, var_122=2, var_125=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_72=0] [L196] var_61 = var_61 & mask_SORT_1 [L197] SORT_1 bad_62_arg_0 = var_61; [L198] CALL __VERIFIER_assert(!(bad_62_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1630 locations, 2449 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4756 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4756 mSDsluCounter, 37119 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25762 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11658 IncrementalHoareTripleChecker+Invalid, 11661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 11357 mSDtfsCounter, 11658 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1694occurred in iteration=6, InterpolantAutomatonStates: 27, 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, 1496 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 1363 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 20:51:53,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:51:54,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:51:54,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 20:51:54,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:51:54,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:51:54,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:51:54,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:51:54,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:51:54,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:51:54,955 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:51:54,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:51:54,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:51:54,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:51:54,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:51:54,956 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:51:54,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:51:54,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:51:54,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:51:54,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:51:54,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:51:54,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:51:54,957 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 20:51:54,957 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 20:51:54,958 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 20:51:54,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:51:54,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:51:54,958 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:51:54,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:51:54,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:51:54,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:51:54,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:51:54,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:51:54,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:51:54,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:51:54,959 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:51:54,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:51:54,959 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 20:51:54,959 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 20:51:54,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:51:54,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:51:54,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:51:54,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:51:54,960 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 -> 4bdfff36879874a6399b96a47b24759f6fa08750adc90ba43c136ab307fb0948 [2025-03-16 20:51:55,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:51:55,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:51:55,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:51:55,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:51:55,196 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:51:55,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2025-03-16 20:51:56,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047994682/5bf25b780d194507a0d2ed8caae469df/FLAGa0b844c28 [2025-03-16 20:51:56,569 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:51:56,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.2.prop1-func-interl.c [2025-03-16 20:51:56,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047994682/5bf25b780d194507a0d2ed8caae469df/FLAGa0b844c28 [2025-03-16 20:51:56,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047994682/5bf25b780d194507a0d2ed8caae469df [2025-03-16 20:51:56,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:51:56,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:51:56,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:51:56,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:51:56,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:51:56,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:51:56" (1/1) ... [2025-03-16 20:51:56,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48bc6da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:56, skipping insertion in model container [2025-03-16 20:51:56,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:51:56" (1/1) ... [2025-03-16 20:51:56,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:51:57,049 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.anderson.2.prop1-func-interl.c[1175,1188] [2025-03-16 20:51:57,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:51:57,231 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:51:57,238 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.anderson.2.prop1-func-interl.c[1175,1188] [2025-03-16 20:51:57,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:51:57,319 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:51:57,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57 WrapperNode [2025-03-16 20:51:57,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:51:57,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:51:57,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:51:57,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:51:57,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,420 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1369 [2025-03-16 20:51:57,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:51:57,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:51:57,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:51:57,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:51:57,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,460 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 20:51:57,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:51:57,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:51:57,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:51:57,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:51:57,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (1/1) ... [2025-03-16 20:51:57,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:51:57,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:57,550 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 20:51:57,553 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 20:51:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:51:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 20:51:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:51:57,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:51:57,768 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:51:57,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:51:59,663 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-16 20:51:59,663 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:51:59,669 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:51:59,670 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:51:59,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:51:59 BoogieIcfgContainer [2025-03-16 20:51:59,670 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:51:59,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:51:59,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:51:59,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:51:59,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:51:56" (1/3) ... [2025-03-16 20:51:59,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9baf8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:51:59, skipping insertion in model container [2025-03-16 20:51:59,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:51:57" (2/3) ... [2025-03-16 20:51:59,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9baf8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:51:59, skipping insertion in model container [2025-03-16 20:51:59,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:51:59" (3/3) ... [2025-03-16 20:51:59,678 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.2.prop1-func-interl.c [2025-03-16 20:51:59,690 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:51:59,691 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.anderson.2.prop1-func-interl.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 20:51:59,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:51:59,732 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;@53556aae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:51:59,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 20:51:59,735 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 20:51:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 20:51:59,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:51:59,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 20:51:59,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:51:59,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:51:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 20:51:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 20:51:59,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461916273] [2025-03-16 20:51:59,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:51:59,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:51:59,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:51:59,756 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 20:51:59,758 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 20:51:59,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 20:52:00,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 20:52:00,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:00,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:00,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-16 20:52:00,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:52:00,290 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 20:52:00,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:52:00,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 20:52:00,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461916273] [2025-03-16 20:52:00,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461916273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:52:00,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:52:00,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:52:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569473840] [2025-03-16 20:52:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:52:00,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:52:00,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 20:52:00,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:52:00,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:52:00,306 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 20:52:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:52:00,793 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 20:52:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:52:00,795 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 20:52:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:52:00,799 INFO L225 Difference]: With dead ends: 16 [2025-03-16 20:52:00,799 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 20:52:00,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:52:00,804 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:52:00,806 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.4s Time] [2025-03-16 20:52:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 20:52:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 20:52:00,824 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 20:52:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 20:52:00,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 20:52:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:52:00,827 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 20:52:00,828 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 20:52:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 20:52:00,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 20:52:00,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:52:00,828 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 20:52:00,836 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 20:52:01,033 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 20:52:01,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:52:01,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:52:01,034 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 20:52:01,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 20:52:01,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607884681] [2025-03-16 20:52:01,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:52:01,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:52:01,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:52:01,037 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 20:52:01,037 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 20:52:01,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 20:52:01,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 20:52:01,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:52:01,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:52:01,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-16 20:52:01,521 INFO L279 TraceCheckSpWp]: Computing forward predicates...