./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f74c0f64dd8b514a3fa45ba4f87a322c4df7984da96078fd039eb406238ea150 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:07:05,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:07:05,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:07:05,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:07:05,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:07:05,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:07:05,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:07:05,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:07:05,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:07:05,952 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:07:05,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:07:05,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:07:05,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:07:05,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:07:05,953 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:07:05,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:07:05,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:07:05,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:07:05,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:07:05,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:07:05,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:07:05,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:07:05,955 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f74c0f64dd8b514a3fa45ba4f87a322c4df7984da96078fd039eb406238ea150 [2025-02-05 18:07:06,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:07:06,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:07:06,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:07:06,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:07:06,279 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:07:06,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c [2025-02-05 18:07:07,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0843bd7ed/47d8b3aa85fd45f9952f9cd5a533682b/FLAGa076d6820 [2025-02-05 18:07:07,944 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:07:07,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c [2025-02-05 18:07:07,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0843bd7ed/47d8b3aa85fd45f9952f9cd5a533682b/FLAGa076d6820 [2025-02-05 18:07:07,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0843bd7ed/47d8b3aa85fd45f9952f9cd5a533682b [2025-02-05 18:07:07,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:07:07,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:07:07,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:07:07,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:07:07,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:07:07,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:07:07" (1/1) ... [2025-02-05 18:07:07,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e7967b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:07, skipping insertion in model container [2025-02-05 18:07:07,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:07:07" (1/1) ... [2025-02-05 18:07:08,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:07:08,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c[1175,1188] [2025-02-05 18:07:08,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:07:08,358 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:07:08,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c[1175,1188] [2025-02-05 18:07:08,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:07:08,515 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:07:08,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08 WrapperNode [2025-02-05 18:07:08,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:07:08,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:07:08,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:07:08,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:07:08,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:08,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,025 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4892 [2025-02-05 18:07:09,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:07:09,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:07:09,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:07:09,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:07:09,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,309 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-02-05 18:07:09,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:07:09,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:07:09,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:07:09,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:07:09,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (1/1) ... [2025-02-05 18:07:09,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:07:09,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:07:09,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 18:07:09,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 18:07:09,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:07:09,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:07:09,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:07:09,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:07:10,128 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:07:10,129 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:07:13,966 INFO L? ?]: Removed 2661 outVars from TransFormulas that were not future-live. [2025-02-05 18:07:13,966 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:07:14,124 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:07:14,125 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:07:14,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:07:14 BoogieIcfgContainer [2025-02-05 18:07:14,125 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:07:14,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:07:14,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:07:14,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:07:14,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:07:07" (1/3) ... [2025-02-05 18:07:14,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f252d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:07:14, skipping insertion in model container [2025-02-05 18:07:14,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:08" (2/3) ... [2025-02-05 18:07:14,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f252d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:07:14, skipping insertion in model container [2025-02-05 18:07:14,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:07:14" (3/3) ... [2025-02-05 18:07:14,132 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.3.prop1-func-interl.c [2025-02-05 18:07:14,143 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:07:14,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.anderson.3.prop1-func-interl.c that has 1 procedures, 1722 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:07:14,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:07:14,342 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;@2ef619d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:07:14,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:07:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 1722 states, 1720 states have (on average 1.505232558139535) internal successors, (2589), 1721 states have internal predecessors, (2589), 0 states have call successors, (0), 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-02-05 18:07:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 18:07:14,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:14,365 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-02-05 18:07:14,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:14,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2082878248, now seen corresponding path program 1 times [2025-02-05 18:07:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:07:14,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879438190] [2025-02-05 18:07:14,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:07:14,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 18:07:14,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 18:07:14,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:14,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:07:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:07:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:07:15,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879438190] [2025-02-05 18:07:15,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879438190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:07:15,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:07:15,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:07:15,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327394287] [2025-02-05 18:07:15,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:07:15,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:07:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:07:15,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:07:15,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:07:15,209 INFO L87 Difference]: Start difference. First operand has 1722 states, 1720 states have (on average 1.505232558139535) internal successors, (2589), 1721 states have internal predecessors, (2589), 0 states have call successors, (0), 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.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-02-05 18:07:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:07:15,981 INFO L93 Difference]: Finished difference Result 3349 states and 5039 transitions. [2025-02-05 18:07:15,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:07:15,982 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-02-05 18:07:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:07:15,995 INFO L225 Difference]: With dead ends: 3349 [2025-02-05 18:07:15,996 INFO L226 Difference]: Without dead ends: 1721 [2025-02-05 18:07:16,001 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-02-05 18:07:16,003 INFO L435 NwaCegarLoop]: 2160 mSDtfsCounter, 0 mSDsluCounter, 4315 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6475 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:07:16,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6475 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:07:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2025-02-05 18:07:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1721. [2025-02-05 18:07:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 1.5040697674418604) internal successors, (2587), 1720 states have internal predecessors, (2587), 0 states have call successors, (0), 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-02-05 18:07:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2587 transitions. [2025-02-05 18:07:16,083 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2587 transitions. Word has length 79 [2025-02-05 18:07:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:07:16,083 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2587 transitions. [2025-02-05 18:07:16,083 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-02-05 18:07:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2587 transitions. [2025-02-05 18:07:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 18:07:16,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:16,085 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-02-05 18:07:16,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 18:07:16,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:16,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:16,086 INFO L85 PathProgramCache]: Analyzing trace with hash 149398135, now seen corresponding path program 1 times [2025-02-05 18:07:16,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:07:16,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914000361] [2025-02-05 18:07:16,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:16,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:07:16,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 18:07:16,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 18:07:16,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:16,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:07:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:07:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:07:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914000361] [2025-02-05 18:07:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914000361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:07:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:07:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:07:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875835690] [2025-02-05 18:07:16,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:07:16,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:07:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:07:16,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:07:16,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:07:16,287 INFO L87 Difference]: Start difference. First operand 1721 states and 2587 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-02-05 18:07:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:07:17,061 INFO L93 Difference]: Finished difference Result 3350 states and 5037 transitions. [2025-02-05 18:07:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:07:17,061 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-02-05 18:07:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:07:17,066 INFO L225 Difference]: With dead ends: 3350 [2025-02-05 18:07:17,067 INFO L226 Difference]: Without dead ends: 1723 [2025-02-05 18:07:17,068 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-02-05 18:07:17,069 INFO L435 NwaCegarLoop]: 2160 mSDtfsCounter, 0 mSDsluCounter, 4312 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6472 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:07:17,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6472 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:07:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-02-05 18:07:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2025-02-05 18:07:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1722 states have (on average 1.5034843205574913) internal successors, (2589), 1722 states have internal predecessors, (2589), 0 states have call successors, (0), 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-02-05 18:07:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2589 transitions. [2025-02-05 18:07:17,096 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2589 transitions. Word has length 80 [2025-02-05 18:07:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:07:17,096 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2589 transitions. [2025-02-05 18:07:17,096 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-02-05 18:07:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2589 transitions. [2025-02-05 18:07:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 18:07:17,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:17,101 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-02-05 18:07:17,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:07:17,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:17,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2027080445, now seen corresponding path program 1 times [2025-02-05 18:07:17,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:07:17,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51601938] [2025-02-05 18:07:17,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:17,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:07:17,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 18:07:17,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 18:07:17,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:17,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:07:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:07:17,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:07:17,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51601938] [2025-02-05 18:07:17,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51601938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:07:17,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:07:17,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:07:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633984746] [2025-02-05 18:07:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:07:17,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:07:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:07:17,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:07:17,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:07:17,280 INFO L87 Difference]: Start difference. First operand 1723 states and 2589 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-02-05 18:07:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:07:17,928 INFO L93 Difference]: Finished difference Result 3358 states and 5047 transitions. [2025-02-05 18:07:17,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:07:17,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-02-05 18:07:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:07:17,934 INFO L225 Difference]: With dead ends: 3358 [2025-02-05 18:07:17,934 INFO L226 Difference]: Without dead ends: 1729 [2025-02-05 18:07:17,936 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-02-05 18:07:17,937 INFO L435 NwaCegarLoop]: 2160 mSDtfsCounter, 4 mSDsluCounter, 4307 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6467 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:07:17,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6467 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:07:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-02-05 18:07:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1729. [2025-02-05 18:07:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1728 states have (on average 1.5028935185185186) internal successors, (2597), 1728 states have internal predecessors, (2597), 0 states have call successors, (0), 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-02-05 18:07:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2597 transitions. [2025-02-05 18:07:17,962 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2597 transitions. Word has length 81 [2025-02-05 18:07:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:07:17,962 INFO L471 AbstractCegarLoop]: Abstraction has 1729 states and 2597 transitions. [2025-02-05 18:07:17,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-02-05 18:07:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2597 transitions. [2025-02-05 18:07:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 18:07:17,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:17,963 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-02-05 18:07:17,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:07:17,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:17,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash 664093441, now seen corresponding path program 1 times [2025-02-05 18:07:17,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:07:17,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654821609] [2025-02-05 18:07:17,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:17,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:07:17,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 18:07:17,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 18:07:17,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:17,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:07:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:07:18,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:07:18,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654821609] [2025-02-05 18:07:18,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654821609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:07:18,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:07:18,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:07:18,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009439496] [2025-02-05 18:07:18,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:07:18,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:07:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:07:18,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:07:18,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:07:18,124 INFO L87 Difference]: Start difference. First operand 1729 states and 2597 transitions. Second operand has 5 states, 5 states have (on average 16.4) 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-02-05 18:07:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:07:19,896 INFO L93 Difference]: Finished difference Result 3368 states and 5059 transitions. [2025-02-05 18:07:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:07:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) 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-02-05 18:07:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:07:19,911 INFO L225 Difference]: With dead ends: 3368 [2025-02-05 18:07:19,911 INFO L226 Difference]: Without dead ends: 1733 [2025-02-05 18:07:19,918 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-02-05 18:07:19,920 INFO L435 NwaCegarLoop]: 2160 mSDtfsCounter, 0 mSDsluCounter, 6452 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8612 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:07:19,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8612 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 18:07:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-02-05 18:07:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1729. [2025-02-05 18:07:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1728 states have (on average 1.5028935185185186) internal successors, (2597), 1728 states have internal predecessors, (2597), 0 states have call successors, (0), 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-02-05 18:07:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2597 transitions. [2025-02-05 18:07:20,005 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2597 transitions. Word has length 82 [2025-02-05 18:07:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:07:20,009 INFO L471 AbstractCegarLoop]: Abstraction has 1729 states and 2597 transitions. [2025-02-05 18:07:20,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) 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-02-05 18:07:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2597 transitions. [2025-02-05 18:07:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 18:07:20,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:20,010 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-02-05 18:07:20,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:07:20,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:20,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1000425438, now seen corresponding path program 1 times [2025-02-05 18:07:20,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:07:20,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638479023] [2025-02-05 18:07:20,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:20,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:07:20,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 18:07:20,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 18:07:20,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:20,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:07:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:07:20,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:07:20,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638479023] [2025-02-05 18:07:20,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638479023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:07:20,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:07:20,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:07:20,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481052939] [2025-02-05 18:07:20,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:07:20,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:07:20,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:07:20,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:07:20,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:07:20,645 INFO L87 Difference]: Start difference. First operand 1729 states and 2597 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 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-02-05 18:07:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:07:22,879 INFO L93 Difference]: Finished difference Result 4983 states and 7487 transitions. [2025-02-05 18:07:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:07:22,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 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-02-05 18:07:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:07:22,889 INFO L225 Difference]: With dead ends: 4983 [2025-02-05 18:07:22,890 INFO L226 Difference]: Without dead ends: 3348 [2025-02-05 18:07:22,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:07:22,892 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 2497 mSDsluCounter, 5073 mSDsCounter, 0 mSdLazyCounter, 3407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2497 SdHoareTripleChecker+Valid, 6794 SdHoareTripleChecker+Invalid, 3408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 18:07:22,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2497 Valid, 6794 Invalid, 3408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3407 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 18:07:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2025-02-05 18:07:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 1772. [2025-02-05 18:07:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1771 states have (on average 1.5019762845849802) internal successors, (2660), 1771 states have internal predecessors, (2660), 0 states have call successors, (0), 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-02-05 18:07:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2660 transitions. [2025-02-05 18:07:22,930 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2660 transitions. Word has length 83 [2025-02-05 18:07:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:07:22,931 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2660 transitions. [2025-02-05 18:07:22,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 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-02-05 18:07:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2660 transitions. [2025-02-05 18:07:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 18:07:22,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:22,932 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-02-05 18:07:22,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:07:22,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:22,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash 120223655, now seen corresponding path program 1 times [2025-02-05 18:07:22,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:07:22,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834554999] [2025-02-05 18:07:22,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:22,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:07:22,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 18:07:22,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 18:07:22,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:22,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:07:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:07:23,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:07:23,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834554999] [2025-02-05 18:07:23,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834554999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:07:23,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:07:23,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:07:23,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983650454] [2025-02-05 18:07:23,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:07:23,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:07:23,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:07:23,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:07:23,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:07:23,217 INFO L87 Difference]: Start difference. First operand 1772 states and 2660 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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-02-05 18:07:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:07:24,680 INFO L93 Difference]: Finished difference Result 3407 states and 5117 transitions. [2025-02-05 18:07:24,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:07:24,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-02-05 18:07:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:07:24,688 INFO L225 Difference]: With dead ends: 3407 [2025-02-05 18:07:24,688 INFO L226 Difference]: Without dead ends: 1772 [2025-02-05 18:07:24,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:07:24,695 INFO L435 NwaCegarLoop]: 1713 mSDtfsCounter, 2509 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 2611 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2509 SdHoareTripleChecker+Valid, 5130 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:07:24,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2509 Valid, 5130 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2611 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 18:07:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-02-05 18:07:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1772. [2025-02-05 18:07:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1771 states have (on average 1.4997176736307172) internal successors, (2656), 1771 states have internal predecessors, (2656), 0 states have call successors, (0), 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-02-05 18:07:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2656 transitions. [2025-02-05 18:07:24,767 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2656 transitions. Word has length 84 [2025-02-05 18:07:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:07:24,767 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2656 transitions. [2025-02-05 18:07:24,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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-02-05 18:07:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2656 transitions. [2025-02-05 18:07:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 18:07:24,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:24,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:07:24,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:07:24,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:24,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1436243393, now seen corresponding path program 1 times [2025-02-05 18:07:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:07:24,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012697484] [2025-02-05 18:07:24,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:24,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:07:24,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 18:07:24,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 18:07:24,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:24,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 18:07:24,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 18:07:24,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 18:07:24,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 18:07:24,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:24,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 18:07:24,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 18:07:24,981 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 18:07:24,981 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 18:07:24,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 18:07:24,985 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:07:25,041 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 18:07:25,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 18:07:25,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 06:07:25 BoogieIcfgContainer [2025-02-05 18:07:25,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 18:07:25,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 18:07:25,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 18:07:25,065 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 18:07:25,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:07:14" (3/4) ... [2025-02-05 18:07:25,067 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 18:07:25,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 18:07:25,069 INFO L158 Benchmark]: Toolchain (without parser) took 17083.39ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 121.5MB in the beginning and 352.6MB in the end (delta: -231.1MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2025-02-05 18:07:25,069 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 18:07:25,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.57ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 59.4MB in the end (delta: 62.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-05 18:07:25,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 508.60ms. Allocated memory was 167.8MB in the beginning and 184.5MB in the end (delta: 16.8MB). Free memory was 59.4MB in the beginning and 69.9MB in the end (delta: -10.5MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. [2025-02-05 18:07:25,070 INFO L158 Benchmark]: Boogie Preprocessor took 567.49ms. Allocated memory was 184.5MB in the beginning and 553.6MB in the end (delta: 369.1MB). Free memory was 69.9MB in the beginning and 419.2MB in the end (delta: -349.3MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2025-02-05 18:07:25,070 INFO L158 Benchmark]: IcfgBuilder took 4530.25ms. Allocated memory was 553.6MB in the beginning and 453.0MB in the end (delta: -100.7MB). Free memory was 419.2MB in the beginning and 76.1MB in the end (delta: 343.2MB). Peak memory consumption was 258.3MB. Max. memory is 16.1GB. [2025-02-05 18:07:25,070 INFO L158 Benchmark]: TraceAbstraction took 10937.10ms. Allocated memory was 453.0MB in the beginning and 503.3MB in the end (delta: 50.3MB). Free memory was 76.1MB in the beginning and 352.6MB in the end (delta: -276.6MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2025-02-05 18:07:25,071 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 503.3MB. Free memory was 352.6MB in the beginning and 352.6MB in the end (delta: 17.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 18:07:25,072 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.21ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.57ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 59.4MB in the end (delta: 62.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 508.60ms. Allocated memory was 167.8MB in the beginning and 184.5MB in the end (delta: 16.8MB). Free memory was 59.4MB in the beginning and 69.9MB in the end (delta: -10.5MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 567.49ms. Allocated memory was 184.5MB in the beginning and 553.6MB in the end (delta: 369.1MB). Free memory was 69.9MB in the beginning and 419.2MB in the end (delta: -349.3MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * IcfgBuilder took 4530.25ms. Allocated memory was 553.6MB in the beginning and 453.0MB in the end (delta: -100.7MB). Free memory was 419.2MB in the beginning and 76.1MB in the end (delta: 343.2MB). Peak memory consumption was 258.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10937.10ms. Allocated memory was 453.0MB in the beginning and 503.3MB in the end (delta: 50.3MB). Free memory was 76.1MB in the beginning and 352.6MB in the end (delta: -276.6MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 503.3MB. Free memory was 352.6MB in the beginning and 352.6MB in the end (delta: 17.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 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_78 = 0; [L46] const SORT_4 var_131 = 2; [L47] const SORT_2 var_242 = 2; [L49] SORT_1 input_64; [L50] SORT_1 input_72; [L51] SORT_1 input_79; [L52] SORT_1 input_85; [L53] SORT_1 input_91; [L54] SORT_1 input_97; [L55] SORT_1 input_151; [L56] SORT_1 input_155; [L57] SORT_1 input_158; [L58] SORT_1 input_159; [L59] SORT_1 input_160; [L60] SORT_1 input_161; [L61] SORT_1 input_169; [L62] SORT_1 input_175; [L63] SORT_1 input_181; [L64] SORT_1 input_196; [L65] SORT_1 input_214; [L66] SORT_1 input_232; [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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_20=0, var_242=2, var_53=1, var_54=0, var_5=0, var_63=1, var_65=0, var_68=3, var_78=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L140] input_64 = __VERIFIER_nondet_uchar() [L141] input_72 = __VERIFIER_nondet_uchar() [L142] input_79 = __VERIFIER_nondet_uchar() [L143] input_85 = __VERIFIER_nondet_uchar() [L144] input_91 = __VERIFIER_nondet_uchar() [L145] input_97 = __VERIFIER_nondet_uchar() [L146] input_151 = __VERIFIER_nondet_uchar() [L147] EXPR input_151 & 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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L147] input_151 = input_151 & mask_SORT_1 [L148] input_155 = __VERIFIER_nondet_uchar() [L149] EXPR input_155 & mask_SORT_1 VAL [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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L149] input_155 = input_155 & mask_SORT_1 [L150] input_158 = __VERIFIER_nondet_uchar() [L151] EXPR input_158 & mask_SORT_1 VAL [input_151=0, input_155=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L151] input_158 = input_158 & mask_SORT_1 [L152] input_159 = __VERIFIER_nondet_uchar() [L153] EXPR input_159 & mask_SORT_1 VAL [input_151=0, input_155=0, input_158=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L153] input_159 = input_159 & mask_SORT_1 [L154] input_160 = __VERIFIER_nondet_uchar() [L155] EXPR input_160 & mask_SORT_1 VAL [input_151=0, input_155=0, input_158=0, input_159=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L155] input_160 = input_160 & mask_SORT_1 [L156] input_161 = __VERIFIER_nondet_uchar() [L157] EXPR input_161 & mask_SORT_1 VAL [input_151=0, input_155=0, input_158=0, input_159=0, input_160=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L157] input_161 = input_161 & mask_SORT_1 [L158] input_169 = __VERIFIER_nondet_uchar() [L159] EXPR input_169 & mask_SORT_1 VAL [input_151=0, input_155=0, input_158=0, input_159=0, input_160=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L159] input_169 = input_169 & mask_SORT_1 [L160] input_175 = __VERIFIER_nondet_uchar() [L161] EXPR input_175 & mask_SORT_1 VAL [input_151=0, input_155=0, input_158=0, input_159=0, input_160=0, input_161=0, input_169=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L161] input_175 = input_175 & mask_SORT_1 [L162] input_181 = __VERIFIER_nondet_uchar() [L163] EXPR input_181 & mask_SORT_1 VAL [input_151=0, input_155=0, input_158=0, input_159=0, input_160=0, input_161=0, input_169=0, input_175=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L163] input_181 = input_181 & mask_SORT_1 [L164] input_196 = __VERIFIER_nondet_uchar() [L165] input_214 = __VERIFIER_nondet_uchar() [L166] input_232 = __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_151=0, input_155=0, input_158=0, input_159=0, input_160=0, input_161=0, input_169=0, input_175=0, input_181=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_131=2, var_242=2, var_53=1, var_54=0, var_59=0, var_63=1, var_65=0, var_68=3, var_78=0] [L187] EXPR var_59 & mask_SORT_4 VAL [input_151=0, input_155=0, input_158=0, input_159=0, input_160=0, input_161=0, input_169=0, input_175=0, input_181=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=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_151=0, input_155=0, input_158=0, input_159=0, input_160=0, input_161=0, input_169=0, input_175=0, input_181=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_131=2, var_242=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_78=0] [L192] EXPR var_61_arg_0 & mask_SORT_1 VAL [input_151=0, input_155=0, input_158=0, input_159=0, input_160=0, input_161=0, input_169=0, input_175=0, input_181=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_131=2, var_242=2, var_53=1, var_54=0, var_60=1, var_63=1, var_65=0, var_68=3, var_78=0] [L192] var_61_arg_0 = var_61_arg_0 & mask_SORT_1 [L193] SORT_1 var_61_arg_1 = ~var_60; VAL [input_151=0, input_155=0, input_158=0, input_159=0, input_160=0, input_161=0, input_169=0, input_175=0, input_181=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_131=2, var_242=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_78=0] [L194] EXPR var_61_arg_1 & mask_SORT_1 VAL [input_151=0, input_155=0, input_158=0, input_159=0, input_160=0, input_161=0, input_169=0, input_175=0, input_181=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_131=2, var_242=2, var_53=1, var_54=0, var_61_arg_0=1, var_63=1, var_65=0, var_68=3, var_78=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_151=0, input_155=0, input_158=0, input_159=0, input_160=0, input_161=0, input_169=0, input_175=0, input_181=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=0] [L195] SORT_1 var_61 = var_61_arg_0 & var_61_arg_1; [L196] EXPR var_61 & mask_SORT_1 VAL [input_151=0, input_155=0, input_158=0, input_159=0, input_160=0, input_161=0, input_169=0, input_175=0, input_181=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_131=2, var_242=2, var_53=1, var_54=0, var_63=1, var_65=0, var_68=3, var_78=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, 1722 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5010 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5010 mSDsluCounter, 39950 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27876 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11593 IncrementalHoareTripleChecker+Invalid, 11596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 12074 mSDtfsCounter, 11593 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1772occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1580 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 1116 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-02-05 18:07:25,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f74c0f64dd8b514a3fa45ba4f87a322c4df7984da96078fd039eb406238ea150 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:07:27,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:07:27,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 18:07:27,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:07:27,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:07:27,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:07:27,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:07:27,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:07:27,694 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:07:27,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:07:27,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:07:27,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 18:07:27,695 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:07:27,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:07:27,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:07:27,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:07:27,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:07:27,697 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f74c0f64dd8b514a3fa45ba4f87a322c4df7984da96078fd039eb406238ea150 [2025-02-05 18:07:27,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:07:27,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:07:27,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:07:27,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:07:27,938 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:07:27,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c [2025-02-05 18:07:29,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a67ee35b8/45b813b9299b4f059dcc7c9052330944/FLAG526cf9693 [2025-02-05 18:07:29,487 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:07:29,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c [2025-02-05 18:07:29,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a67ee35b8/45b813b9299b4f059dcc7c9052330944/FLAG526cf9693 [2025-02-05 18:07:29,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a67ee35b8/45b813b9299b4f059dcc7c9052330944 [2025-02-05 18:07:29,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:07:29,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:07:29,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:07:29,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:07:29,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:07:29,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:07:29" (1/1) ... [2025-02-05 18:07:29,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70696c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:29, skipping insertion in model container [2025-02-05 18:07:29,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:07:29" (1/1) ... [2025-02-05 18:07:29,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:07:29,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c[1175,1188] [2025-02-05 18:07:29,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:07:29,924 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:07:29,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.3.prop1-func-interl.c[1175,1188] [2025-02-05 18:07:30,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:07:30,036 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:07:30,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30 WrapperNode [2025-02-05 18:07:30,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:07:30,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:07:30,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:07:30,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:07:30,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,151 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1432 [2025-02-05 18:07:30,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:07:30,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:07:30,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:07:30,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:07:30,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,198 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-02-05 18:07:30,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:07:30,268 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:07:30,268 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:07:30,268 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:07:30,269 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (1/1) ... [2025-02-05 18:07:30,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:07:30,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:07:30,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 18:07:30,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 18:07:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:07:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 18:07:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:07:30,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:07:30,539 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:07:30,540 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:07:34,990 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-02-05 18:07:34,990 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:07:34,998 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:07:34,999 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:07:35,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:07:35 BoogieIcfgContainer [2025-02-05 18:07:35,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:07:35,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:07:35,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:07:35,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:07:35,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:07:29" (1/3) ... [2025-02-05 18:07:35,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0434c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:07:35, skipping insertion in model container [2025-02-05 18:07:35,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:07:30" (2/3) ... [2025-02-05 18:07:35,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0434c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:07:35, skipping insertion in model container [2025-02-05 18:07:35,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:07:35" (3/3) ... [2025-02-05 18:07:35,013 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.3.prop1-func-interl.c [2025-02-05 18:07:35,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:07:35,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.anderson.3.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:07:35,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:07:35,085 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;@2faded02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:07:35,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:07:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:07:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 18:07:35,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:35,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 18:07:35,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:35,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:35,103 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 18:07:35,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 18:07:35,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035013548] [2025-02-05 18:07:35,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:35,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:07:35,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:07:35,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 18:07:35,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 18:07:35,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 18:07:35,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 18:07:35,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:35,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:07:35,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 18:07:35,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:07:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:07:36,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:07:36,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 18:07:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035013548] [2025-02-05 18:07:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035013548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:07:36,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:07:36,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:07:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747239735] [2025-02-05 18:07:36,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:07:36,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:07:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 18:07:36,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:07:36,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:07:36,151 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:07:37,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 18:07:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:07:37,618 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 18:07:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:07:37,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-05 18:07:37,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:07:37,633 INFO L225 Difference]: With dead ends: 18 [2025-02-05 18:07:37,634 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 18:07:37,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:07:37,640 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:07:37,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 18:07:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 18:07:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 18:07:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:07:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 18:07:37,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 18:07:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:07:37,672 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 18:07:37,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:07:37,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 18:07:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 18:07:37,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:07:37,673 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 18:07:37,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 18:07:37,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:07:37,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:07:37,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:07:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 18:07:37,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 18:07:37,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362521278] [2025-02-05 18:07:37,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:07:37,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:07:37,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:07:37,882 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 18:07:37,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 18:07:38,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 18:07:38,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 18:07:38,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:07:38,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:07:38,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-05 18:07:38,692 INFO L279 TraceCheckSpWp]: Computing forward predicates...